./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC --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 e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 00:04:54,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 00:04:54,657 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-24 00:04:54,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 00:04:54,664 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 00:04:54,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 00:04:54,694 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 00:04:54,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 00:04:54,695 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 00:04:54,695 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 00:04:54,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 00:04:54,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 00:04:54,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 00:04:54,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 00:04:54,696 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 00:04:54,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 00:04:54,697 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 00:04:54,697 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 00:04:54,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 00:04:54,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 00:04:54,698 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-24 00:04:54,698 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-24 00:04:54,698 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-24 00:04:54,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 00:04:54,698 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 00:04:54,698 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-24 00:04:54,699 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 00:04:54,699 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 00:04:54,699 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 00:04:54,699 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 00:04:54,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:04:54,700 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:04:54,700 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:04:54,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:04:54,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 00:04:54,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:04:54,700 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:04:54,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:04:54,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:04:54,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 00:04:54,701 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 00:04:54,701 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 00:04:54,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 00:04:54,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 00:04:54,702 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 00:04:54,702 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 00:04:54,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 00:04:54,702 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC 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 -> e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae [2024-11-24 00:04:55,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 00:04:55,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 00:04:55,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 00:04:55,067 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 00:04:55,069 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 00:04:55,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2024-11-24 00:04:58,554 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/data/0e7a664ae/6b759be0b03242acb4f4f88c176f8a83/FLAG6041057f2 [2024-11-24 00:04:58,984 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 00:04:58,984 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2024-11-24 00:04:59,006 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/data/0e7a664ae/6b759be0b03242acb4f4f88c176f8a83/FLAG6041057f2 [2024-11-24 00:04:59,033 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/data/0e7a664ae/6b759be0b03242acb4f4f88c176f8a83 [2024-11-24 00:04:59,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 00:04:59,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 00:04:59,041 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 00:04:59,041 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 00:04:59,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 00:04:59,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:04:59" (1/1) ... [2024-11-24 00:04:59,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97c373c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:59, skipping insertion in model container [2024-11-24 00:04:59,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:04:59" (1/1) ... [2024-11-24 00:04:59,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 00:04:59,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:04:59,695 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 00:04:59,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:04:59,832 INFO L204 MainTranslator]: Completed translation [2024-11-24 00:04:59,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:59 WrapperNode [2024-11-24 00:04:59,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 00:04:59,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 00:04:59,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 00:04:59,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 00:04:59,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:59" (1/1) ... [2024-11-24 00:04:59,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:59" (1/1) ... [2024-11-24 00:04:59,909 INFO L138 Inliner]: procedures = 174, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2024-11-24 00:04:59,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 00:04:59,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 00:04:59,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 00:04:59,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 00:04:59,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:59" (1/1) ... [2024-11-24 00:04:59,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:59" (1/1) ... [2024-11-24 00:04:59,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:59" (1/1) ... [2024-11-24 00:04:59,949 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-11-24 00:04:59,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:59" (1/1) ... [2024-11-24 00:04:59,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:59" (1/1) ... [2024-11-24 00:04:59,960 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:59" (1/1) ... [2024-11-24 00:04:59,963 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:59" (1/1) ... [2024-11-24 00:04:59,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:59" (1/1) ... [2024-11-24 00:04:59,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:59" (1/1) ... [2024-11-24 00:04:59,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:59" (1/1) ... [2024-11-24 00:04:59,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 00:04:59,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 00:04:59,991 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 00:04:59,991 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 00:04:59,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:59" (1/1) ... [2024-11-24 00:05:00,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:05:00,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:05:00,058 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 00:05:00,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 00:05:00,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-24 00:05:00,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-24 00:05:00,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-24 00:05:00,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-24 00:05:00,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-24 00:05:00,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 00:05:00,098 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-24 00:05:00,099 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-24 00:05:00,099 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-24 00:05:00,099 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-24 00:05:00,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 00:05:00,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-24 00:05:00,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-24 00:05:00,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 00:05:00,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 00:05:00,101 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-24 00:05:00,351 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 00:05:00,355 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 00:05:01,081 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-24 00:05:01,081 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 00:05:01,927 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 00:05:01,929 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-24 00:05:01,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:05:01 BoogieIcfgContainer [2024-11-24 00:05:01,930 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 00:05:01,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 00:05:01,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 00:05:01,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 00:05:01,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:04:59" (1/3) ... [2024-11-24 00:05:01,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce8572e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:05:01, skipping insertion in model container [2024-11-24 00:05:01,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:59" (2/3) ... [2024-11-24 00:05:01,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce8572e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:05:01, skipping insertion in model container [2024-11-24 00:05:01,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:05:01" (3/3) ... [2024-11-24 00:05:01,945 INFO L128 eAbstractionObserver]: Analyzing ICFG safe006_power.oepc-thin000_power.oepc.i [2024-11-24 00:05:01,972 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 00:05:01,974 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe006_power.oepc-thin000_power.oepc.i that has 3 procedures, 61 locations, 1 initial locations, 0 loop locations, and 30 error locations. [2024-11-24 00:05:01,974 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-24 00:05:02,175 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-24 00:05:02,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 62 transitions, 132 flow [2024-11-24 00:05:02,314 INFO L124 PetriNetUnfolderBase]: 2/60 cut-off events. [2024-11-24 00:05:02,320 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:05:02,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 60 events. 2/60 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 194 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2024-11-24 00:05:02,327 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 62 transitions, 132 flow [2024-11-24 00:05:02,333 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 60 transitions, 126 flow [2024-11-24 00:05:02,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:05:02,373 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@214a770a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:05:02,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2024-11-24 00:05:02,385 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-24 00:05:02,386 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-24 00:05:02,386 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:05:02,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:05:02,387 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-24 00:05:02,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-24 00:05:02,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:05:02,395 INFO L85 PathProgramCache]: Analyzing trace with hash 21427459, now seen corresponding path program 1 times [2024-11-24 00:05:02,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:05:02,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877137691] [2024-11-24 00:05:02,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:05:02,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:05:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:05:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:05:02,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:05:02,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877137691] [2024-11-24 00:05:02,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877137691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:05:02,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:05:02,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-24 00:05:02,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084910649] [2024-11-24 00:05:02,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:05:02,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:05:02,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:05:03,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:05:03,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:05:03,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-11-24 00:05:03,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:03,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:05:03,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-11-24 00:05:03,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:05:03,766 INFO L124 PetriNetUnfolderBase]: 564/1085 cut-off events. [2024-11-24 00:05:03,766 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:05:03,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2036 conditions, 1085 events. 564/1085 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7284 event pairs, 564 based on Foata normal form. 56/760 useless extension candidates. Maximal degree in co-relation 2026. Up to 937 conditions per place. [2024-11-24 00:05:03,804 INFO L140 encePairwiseOnDemand]: 39/62 looper letters, 24 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2024-11-24 00:05:03,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 130 flow [2024-11-24 00:05:03,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:05:03,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:05:03,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-11-24 00:05:03,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.478494623655914 [2024-11-24 00:05:03,828 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 126 flow. Second operand 3 states and 89 transitions. [2024-11-24 00:05:03,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 130 flow [2024-11-24 00:05:03,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 37 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 00:05:03,842 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 80 flow [2024-11-24 00:05:03,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2024-11-24 00:05:03,854 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -21 predicate places. [2024-11-24 00:05:03,855 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 80 flow [2024-11-24 00:05:03,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:03,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:05:03,856 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-24 00:05:03,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 00:05:03,857 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-24 00:05:03,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:05:03,858 INFO L85 PathProgramCache]: Analyzing trace with hash 21427460, now seen corresponding path program 1 times [2024-11-24 00:05:03,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:05:03,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366833564] [2024-11-24 00:05:03,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:05:03,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:05:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:05:04,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:05:04,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:05:04,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366833564] [2024-11-24 00:05:04,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366833564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:05:04,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:05:04,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-24 00:05:04,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781251655] [2024-11-24 00:05:04,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:05:04,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:05:04,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:05:04,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:05:04,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:05:04,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-11-24 00:05:04,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:04,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:05:04,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-11-24 00:05:04,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:05:04,321 INFO L124 PetriNetUnfolderBase]: 180/392 cut-off events. [2024-11-24 00:05:04,322 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:05:04,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 392 events. 180/392 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2259 event pairs, 180 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 717. Up to 319 conditions per place. [2024-11-24 00:05:04,327 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 17 selfloop transitions, 1 changer transitions 1/31 dead transitions. [2024-11-24 00:05:04,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 106 flow [2024-11-24 00:05:04,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:05:04,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:05:04,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-11-24 00:05:04,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3602150537634409 [2024-11-24 00:05:04,329 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 80 flow. Second operand 3 states and 67 transitions. [2024-11-24 00:05:04,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 106 flow [2024-11-24 00:05:04,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 105 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 00:05:04,331 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 67 flow [2024-11-24 00:05:04,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2024-11-24 00:05:04,332 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -26 predicate places. [2024-11-24 00:05:04,332 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 67 flow [2024-11-24 00:05:04,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:04,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:05:04,333 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:05:04,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 00:05:04,333 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-24 00:05:04,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:05:04,334 INFO L85 PathProgramCache]: Analyzing trace with hash -211308456, now seen corresponding path program 1 times [2024-11-24 00:05:04,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:05:04,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694509571] [2024-11-24 00:05:04,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:05:04,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:05:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:05:04,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:05:04,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:05:04,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694509571] [2024-11-24 00:05:04,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694509571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:05:04,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:05:04,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-24 00:05:04,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012128852] [2024-11-24 00:05:04,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:05:04,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:05:04,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:05:04,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:05:04,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:05:04,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-11-24 00:05:04,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:04,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:05:04,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-11-24 00:05:04,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:05:04,907 INFO L124 PetriNetUnfolderBase]: 149/394 cut-off events. [2024-11-24 00:05:04,907 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:05:04,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 394 events. 149/394 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2205 event pairs, 29 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 668. Up to 213 conditions per place. [2024-11-24 00:05:04,914 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 28 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2024-11-24 00:05:04,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 153 flow [2024-11-24 00:05:04,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:05:04,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:05:04,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-11-24 00:05:04,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-11-24 00:05:04,919 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 67 flow. Second operand 3 states and 74 transitions. [2024-11-24 00:05:04,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 153 flow [2024-11-24 00:05:04,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 152 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 00:05:04,922 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 76 flow [2024-11-24 00:05:04,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2024-11-24 00:05:04,925 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -25 predicate places. [2024-11-24 00:05:04,925 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 76 flow [2024-11-24 00:05:04,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:04,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:05:04,926 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:05:04,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 00:05:04,927 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-24 00:05:04,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:05:04,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1203937753, now seen corresponding path program 1 times [2024-11-24 00:05:04,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:05:04,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555268382] [2024-11-24 00:05:04,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:05:04,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:05:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:05:05,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:05:05,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:05:05,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555268382] [2024-11-24 00:05:05,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555268382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:05:05,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:05:05,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:05:05,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466271603] [2024-11-24 00:05:05,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:05:05,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:05:05,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:05:05,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:05:05,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:05:05,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-11-24 00:05:05,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:05,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:05:05,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-11-24 00:05:05,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:05:05,449 INFO L124 PetriNetUnfolderBase]: 139/320 cut-off events. [2024-11-24 00:05:05,449 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-24 00:05:05,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 320 events. 139/320 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1651 event pairs, 55 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 652. Up to 194 conditions per place. [2024-11-24 00:05:05,452 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 27 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2024-11-24 00:05:05,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 156 flow [2024-11-24 00:05:05,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:05:05,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-24 00:05:05,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-11-24 00:05:05,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3467741935483871 [2024-11-24 00:05:05,455 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 76 flow. Second operand 4 states and 86 transitions. [2024-11-24 00:05:05,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 156 flow [2024-11-24 00:05:05,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 00:05:05,458 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 72 flow [2024-11-24 00:05:05,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2024-11-24 00:05:05,460 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -25 predicate places. [2024-11-24 00:05:05,460 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 72 flow [2024-11-24 00:05:05,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:05,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:05:05,460 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:05:05,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-24 00:05:05,461 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-24 00:05:05,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:05:05,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1203937752, now seen corresponding path program 1 times [2024-11-24 00:05:05,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:05:05,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602575713] [2024-11-24 00:05:05,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:05:05,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:05:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:05:05,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:05:05,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:05:05,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602575713] [2024-11-24 00:05:05,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602575713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:05:05,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:05:05,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:05:05,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823047843] [2024-11-24 00:05:05,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:05:05,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:05:05,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:05:05,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:05:05,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:05:05,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-11-24 00:05:05,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:05,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:05:05,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-11-24 00:05:05,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:05:06,231 INFO L124 PetriNetUnfolderBase]: 129/358 cut-off events. [2024-11-24 00:05:06,235 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-24 00:05:06,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 358 events. 129/358 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1966 event pairs, 21 based on Foata normal form. 8/363 useless extension candidates. Maximal degree in co-relation 664. Up to 176 conditions per place. [2024-11-24 00:05:06,238 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 26 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2024-11-24 00:05:06,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 150 flow [2024-11-24 00:05:06,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:05:06,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-24 00:05:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2024-11-24 00:05:06,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34274193548387094 [2024-11-24 00:05:06,241 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 72 flow. Second operand 4 states and 85 transitions. [2024-11-24 00:05:06,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 150 flow [2024-11-24 00:05:06,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 145 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-24 00:05:06,242 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 67 flow [2024-11-24 00:05:06,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=67, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2024-11-24 00:05:06,244 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -26 predicate places. [2024-11-24 00:05:06,246 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 67 flow [2024-11-24 00:05:06,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:06,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:05:06,246 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:05:06,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-24 00:05:06,247 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-24 00:05:06,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:05:06,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1641159969, now seen corresponding path program 1 times [2024-11-24 00:05:06,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:05:06,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920866086] [2024-11-24 00:05:06,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:05:06,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:05:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:05:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:05:06,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:05:06,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920866086] [2024-11-24 00:05:06,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920866086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:05:06,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:05:06,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-24 00:05:06,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005342928] [2024-11-24 00:05:06,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:05:06,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:05:06,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:05:06,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:05:06,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:05:06,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 62 [2024-11-24 00:05:06,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:06,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:05:06,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 62 [2024-11-24 00:05:06,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:05:06,476 INFO L124 PetriNetUnfolderBase]: 129/293 cut-off events. [2024-11-24 00:05:06,476 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-24 00:05:06,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 293 events. 129/293 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1533 event pairs, 129 based on Foata normal form. 12/295 useless extension candidates. Maximal degree in co-relation 599. Up to 232 conditions per place. [2024-11-24 00:05:06,479 INFO L140 encePairwiseOnDemand]: 60/62 looper letters, 14 selfloop transitions, 1 changer transitions 1/27 dead transitions. [2024-11-24 00:05:06,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 27 transitions, 97 flow [2024-11-24 00:05:06,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:05:06,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:05:06,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-11-24 00:05:06,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3010752688172043 [2024-11-24 00:05:06,480 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 67 flow. Second operand 3 states and 56 transitions. [2024-11-24 00:05:06,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 27 transitions, 97 flow [2024-11-24 00:05:06,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 27 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 00:05:06,482 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 62 flow [2024-11-24 00:05:06,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2024-11-24 00:05:06,482 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -27 predicate places. [2024-11-24 00:05:06,483 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 62 flow [2024-11-24 00:05:06,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:06,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:05:06,483 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:05:06,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 00:05:06,483 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-24 00:05:06,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:05:06,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1641160601, now seen corresponding path program 1 times [2024-11-24 00:05:06,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:05:06,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007224214] [2024-11-24 00:05:06,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:05:06,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:05:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:05:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:05:06,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:05:06,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007224214] [2024-11-24 00:05:06,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007224214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:05:06,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:05:06,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:05:06,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32634739] [2024-11-24 00:05:06,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:05:06,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:05:06,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:05:06,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:05:06,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:05:06,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2024-11-24 00:05:06,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:06,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:05:06,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2024-11-24 00:05:06,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:05:06,995 INFO L124 PetriNetUnfolderBase]: 180/382 cut-off events. [2024-11-24 00:05:06,995 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:05:06,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 382 events. 180/382 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1757 event pairs, 24 based on Foata normal form. 20/397 useless extension candidates. Maximal degree in co-relation 781. Up to 199 conditions per place. [2024-11-24 00:05:06,999 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 29 selfloop transitions, 4 changer transitions 1/42 dead transitions. [2024-11-24 00:05:06,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 168 flow [2024-11-24 00:05:06,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:05:07,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-24 00:05:07,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2024-11-24 00:05:07,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-11-24 00:05:07,001 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 62 flow. Second operand 4 states and 80 transitions. [2024-11-24 00:05:07,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 168 flow [2024-11-24 00:05:07,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 00:05:07,002 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 87 flow [2024-11-24 00:05:07,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2024-11-24 00:05:07,005 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -24 predicate places. [2024-11-24 00:05:07,006 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 87 flow [2024-11-24 00:05:07,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:07,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:05:07,006 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:05:07,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-24 00:05:07,006 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-24 00:05:07,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:05:07,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1624571733, now seen corresponding path program 1 times [2024-11-24 00:05:07,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:05:07,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746529531] [2024-11-24 00:05:07,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:05:07,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:05:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:05:07,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:05:07,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:05:07,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746529531] [2024-11-24 00:05:07,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746529531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:05:07,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:05:07,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 00:05:07,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105059446] [2024-11-24 00:05:07,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:05:07,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:05:07,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:05:07,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:05:07,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:05:07,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2024-11-24 00:05:07,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:07,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:05:07,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2024-11-24 00:05:07,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:05:07,702 INFO L124 PetriNetUnfolderBase]: 88/194 cut-off events. [2024-11-24 00:05:07,702 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2024-11-24 00:05:07,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 194 events. 88/194 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 620 event pairs, 16 based on Foata normal form. 14/203 useless extension candidates. Maximal degree in co-relation 477. Up to 71 conditions per place. [2024-11-24 00:05:07,704 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 25 selfloop transitions, 6 changer transitions 1/40 dead transitions. [2024-11-24 00:05:07,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 182 flow [2024-11-24 00:05:07,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:05:07,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-24 00:05:07,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2024-11-24 00:05:07,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2870967741935484 [2024-11-24 00:05:07,706 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 87 flow. Second operand 5 states and 89 transitions. [2024-11-24 00:05:07,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 182 flow [2024-11-24 00:05:07,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 173 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-24 00:05:07,708 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 103 flow [2024-11-24 00:05:07,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2024-11-24 00:05:07,709 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -20 predicate places. [2024-11-24 00:05:07,709 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 103 flow [2024-11-24 00:05:07,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:07,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:05:07,710 INFO L206 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] [2024-11-24 00:05:07,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 00:05:07,710 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-24 00:05:07,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:05:07,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1834676303, now seen corresponding path program 1 times [2024-11-24 00:05:07,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:05:07,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255960025] [2024-11-24 00:05:07,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:05:07,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:05:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:05:07,881 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 00:05:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:05:08,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 00:05:08,112 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 00:05:08,113 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (53 of 54 remaining) [2024-11-24 00:05:08,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 54 remaining) [2024-11-24 00:05:08,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 54 remaining) [2024-11-24 00:05:08,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 54 remaining) [2024-11-24 00:05:08,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 54 remaining) [2024-11-24 00:05:08,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 54 remaining) [2024-11-24 00:05:08,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 54 remaining) [2024-11-24 00:05:08,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 54 remaining) [2024-11-24 00:05:08,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 54 remaining) [2024-11-24 00:05:08,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 54 remaining) [2024-11-24 00:05:08,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 54 remaining) [2024-11-24 00:05:08,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 54 remaining) [2024-11-24 00:05:08,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 54 remaining) [2024-11-24 00:05:08,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 54 remaining) [2024-11-24 00:05:08,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 54 remaining) [2024-11-24 00:05:08,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 54 remaining) [2024-11-24 00:05:08,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 54 remaining) [2024-11-24 00:05:08,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 54 remaining) [2024-11-24 00:05:08,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 54 remaining) [2024-11-24 00:05:08,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 54 remaining) [2024-11-24 00:05:08,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 54 remaining) [2024-11-24 00:05:08,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 54 remaining) [2024-11-24 00:05:08,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 54 remaining) [2024-11-24 00:05:08,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 54 remaining) [2024-11-24 00:05:08,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 54 remaining) [2024-11-24 00:05:08,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 54 remaining) [2024-11-24 00:05:08,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 54 remaining) [2024-11-24 00:05:08,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 54 remaining) [2024-11-24 00:05:08,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 54 remaining) [2024-11-24 00:05:08,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (24 of 54 remaining) [2024-11-24 00:05:08,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 54 remaining) [2024-11-24 00:05:08,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 54 remaining) [2024-11-24 00:05:08,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 54 remaining) [2024-11-24 00:05:08,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 54 remaining) [2024-11-24 00:05:08,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 54 remaining) [2024-11-24 00:05:08,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 54 remaining) [2024-11-24 00:05:08,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 54 remaining) [2024-11-24 00:05:08,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 54 remaining) [2024-11-24 00:05:08,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 54 remaining) [2024-11-24 00:05:08,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 54 remaining) [2024-11-24 00:05:08,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 54 remaining) [2024-11-24 00:05:08,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 54 remaining) [2024-11-24 00:05:08,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 54 remaining) [2024-11-24 00:05:08,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 54 remaining) [2024-11-24 00:05:08,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 54 remaining) [2024-11-24 00:05:08,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 54 remaining) [2024-11-24 00:05:08,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 54 remaining) [2024-11-24 00:05:08,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 54 remaining) [2024-11-24 00:05:08,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 54 remaining) [2024-11-24 00:05:08,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 54 remaining) [2024-11-24 00:05:08,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 54 remaining) [2024-11-24 00:05:08,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 54 remaining) [2024-11-24 00:05:08,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 54 remaining) [2024-11-24 00:05:08,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 54 remaining) [2024-11-24 00:05:08,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 00:05:08,127 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:05:08,247 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-24 00:05:08,247 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 00:05:08,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 12:05:08 BasicIcfg [2024-11-24 00:05:08,255 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 00:05:08,256 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 00:05:08,256 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 00:05:08,257 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 00:05:08,258 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:05:01" (3/4) ... [2024-11-24 00:05:08,260 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-24 00:05:08,261 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 00:05:08,261 INFO L158 Benchmark]: Toolchain (without parser) took 9224.03ms. Allocated memory was 117.4MB in the beginning and 209.7MB in the end (delta: 92.3MB). Free memory was 91.6MB in the beginning and 153.9MB in the end (delta: -62.3MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2024-11-24 00:05:08,262 INFO L158 Benchmark]: CDTParser took 0.77ms. Allocated memory is still 117.4MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:05:08,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 792.57ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 68.3MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-24 00:05:08,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.78ms. Allocated memory is still 117.4MB. Free memory was 68.3MB in the beginning and 66.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:05:08,263 INFO L158 Benchmark]: Boogie Preprocessor took 76.82ms. Allocated memory is still 117.4MB. Free memory was 66.1MB in the beginning and 62.7MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 00:05:08,263 INFO L158 Benchmark]: RCFGBuilder took 1939.19ms. Allocated memory is still 117.4MB. Free memory was 62.5MB in the beginning and 85.0MB in the end (delta: -22.5MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. [2024-11-24 00:05:08,263 INFO L158 Benchmark]: TraceAbstraction took 6323.00ms. Allocated memory was 117.4MB in the beginning and 209.7MB in the end (delta: 92.3MB). Free memory was 85.0MB in the beginning and 156.3MB in the end (delta: -71.3MB). Peak memory consumption was 122.8MB. Max. memory is 16.1GB. [2024-11-24 00:05:08,264 INFO L158 Benchmark]: Witness Printer took 4.90ms. Allocated memory is still 209.7MB. Free memory was 156.3MB in the beginning and 153.9MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 00:05:08,267 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.77ms. Allocated memory is still 117.4MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 792.57ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 68.3MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.78ms. Allocated memory is still 117.4MB. Free memory was 68.3MB in the beginning and 66.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 76.82ms. Allocated memory is still 117.4MB. Free memory was 66.1MB in the beginning and 62.7MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1939.19ms. Allocated memory is still 117.4MB. Free memory was 62.5MB in the beginning and 85.0MB in the end (delta: -22.5MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6323.00ms. Allocated memory was 117.4MB in the beginning and 209.7MB in the end (delta: 92.3MB). Free memory was 85.0MB in the beginning and 156.3MB in the end (delta: -71.3MB). Peak memory consumption was 122.8MB. Max. memory is 16.1GB. * Witness Printer took 4.90ms. Allocated memory is still 209.7MB. Free memory was 156.3MB in the beginning and 153.9MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1921; [L814] FCALL, FORK 0 pthread_create(&t1921, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1921=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] EXPR 1 \read(y) [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L760] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L761] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L762] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L763] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L764] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L765] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L766] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L767] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L768] EXPR 1 \read(y) [L768] 1 __unbuffered_p0_EAX = y [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] 1 y = y$flush_delayed ? y$mem_tmp : y [L770] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L773] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L815] 0 pthread_t t1922; [L816] FCALL, FORK 0 pthread_create(&t1922, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1921=-2, t1922=-1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L788] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 \read(y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L794] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L795] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921=-2, t1922=-1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 \read(y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921=-2, t1922=-1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921=-2, t1922=-1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L18] 0 __assert_fail ("0", "safe006_power.oepc-thin000_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - 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: -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: -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: -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: -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: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: 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 5 procedures, 99 locations, 54 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: 5.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 177 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 286 IncrementalHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 0 mSDtfsCounter, 286 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=0, InterpolantAutomatonStates: 29, 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, 2.0s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-24 00:05:08,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC --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 e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 00:05:11,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 00:05:11,779 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-24 00:05:11,793 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 00:05:11,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 00:05:11,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 00:05:11,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 00:05:11,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 00:05:11,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 00:05:11,846 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 00:05:11,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 00:05:11,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 00:05:11,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 00:05:11,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 00:05:11,847 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 00:05:11,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 00:05:11,847 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 00:05:11,847 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 00:05:11,847 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 00:05:11,847 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 00:05:11,847 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-24 00:05:11,848 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-24 00:05:11,848 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-24 00:05:11,848 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 00:05:11,848 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 00:05:11,848 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-24 00:05:11,848 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-24 00:05:11,848 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-24 00:05:11,849 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 00:05:11,849 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 00:05:11,849 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 00:05:11,849 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 00:05:11,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:05:11,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:05:11,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:05:11,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:05:11,852 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 00:05:11,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:05:11,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:05:11,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:05:11,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:05:11,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 00:05:11,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 00:05:11,855 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-24 00:05:11,855 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-24 00:05:11,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 00:05:11,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 00:05:11,856 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 00:05:11,856 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 00:05:11,856 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC 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 -> e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae [2024-11-24 00:05:12,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 00:05:12,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 00:05:12,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 00:05:12,278 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 00:05:12,282 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 00:05:12,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2024-11-24 00:05:15,862 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/data/2d074376d/14fe67624a814fda843cd6391ec6996b/FLAG35e488eef [2024-11-24 00:05:16,225 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 00:05:16,226 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2024-11-24 00:05:16,246 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/data/2d074376d/14fe67624a814fda843cd6391ec6996b/FLAG35e488eef [2024-11-24 00:05:16,265 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/data/2d074376d/14fe67624a814fda843cd6391ec6996b [2024-11-24 00:05:16,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 00:05:16,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 00:05:16,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 00:05:16,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 00:05:16,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 00:05:16,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:05:16" (1/1) ... [2024-11-24 00:05:16,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d416576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:05:16, skipping insertion in model container [2024-11-24 00:05:16,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:05:16" (1/1) ... [2024-11-24 00:05:16,316 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 00:05:16,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:05:16,796 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 00:05:16,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:05:16,990 INFO L204 MainTranslator]: Completed translation [2024-11-24 00:05:16,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:05:16 WrapperNode [2024-11-24 00:05:16,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 00:05:16,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 00:05:16,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 00:05:16,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 00:05:17,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:05:16" (1/1) ... [2024-11-24 00:05:17,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:05:16" (1/1) ... [2024-11-24 00:05:17,088 INFO L138 Inliner]: procedures = 178, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2024-11-24 00:05:17,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 00:05:17,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 00:05:17,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 00:05:17,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 00:05:17,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:05:16" (1/1) ... [2024-11-24 00:05:17,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:05:16" (1/1) ... [2024-11-24 00:05:17,109 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:05:16" (1/1) ... [2024-11-24 00:05:17,153 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-11-24 00:05:17,158 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:05:16" (1/1) ... [2024-11-24 00:05:17,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:05:16" (1/1) ... [2024-11-24 00:05:17,183 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:05:16" (1/1) ... [2024-11-24 00:05:17,184 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:05:16" (1/1) ... [2024-11-24 00:05:17,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:05:16" (1/1) ... [2024-11-24 00:05:17,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:05:16" (1/1) ... [2024-11-24 00:05:17,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:05:16" (1/1) ... [2024-11-24 00:05:17,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 00:05:17,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 00:05:17,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 00:05:17,202 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 00:05:17,203 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:05:16" (1/1) ... [2024-11-24 00:05:17,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:05:17,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:05:17,244 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 00:05:17,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 00:05:17,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-24 00:05:17,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-24 00:05:17,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-24 00:05:17,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 00:05:17,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-24 00:05:17,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-24 00:05:17,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-24 00:05:17,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-24 00:05:17,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-24 00:05:17,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-24 00:05:17,279 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-24 00:05:17,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-24 00:05:17,279 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-24 00:05:17,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-24 00:05:17,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-24 00:05:17,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 00:05:17,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 00:05:17,283 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-24 00:05:17,518 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 00:05:17,522 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 00:05:18,308 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-24 00:05:18,308 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 00:05:19,363 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 00:05:19,364 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-24 00:05:19,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:05:19 BoogieIcfgContainer [2024-11-24 00:05:19,365 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 00:05:19,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 00:05:19,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 00:05:19,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 00:05:19,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:05:16" (1/3) ... [2024-11-24 00:05:19,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17125604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:05:19, skipping insertion in model container [2024-11-24 00:05:19,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:05:16" (2/3) ... [2024-11-24 00:05:19,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17125604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:05:19, skipping insertion in model container [2024-11-24 00:05:19,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:05:19" (3/3) ... [2024-11-24 00:05:19,381 INFO L128 eAbstractionObserver]: Analyzing ICFG safe006_power.oepc-thin000_power.oepc.i [2024-11-24 00:05:19,405 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 00:05:19,408 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe006_power.oepc-thin000_power.oepc.i that has 3 procedures, 61 locations, 1 initial locations, 0 loop locations, and 30 error locations. [2024-11-24 00:05:19,408 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-24 00:05:19,683 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-24 00:05:19,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 62 transitions, 132 flow [2024-11-24 00:05:19,803 INFO L124 PetriNetUnfolderBase]: 2/60 cut-off events. [2024-11-24 00:05:19,806 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:05:19,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 60 events. 2/60 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 194 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2024-11-24 00:05:19,811 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 62 transitions, 132 flow [2024-11-24 00:05:19,818 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 60 transitions, 126 flow [2024-11-24 00:05:19,838 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:05:19,859 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@5dbf4bbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:05:19,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2024-11-24 00:05:19,872 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-24 00:05:19,872 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-24 00:05:19,872 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:05:19,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:05:19,874 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-24 00:05:19,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-24 00:05:19,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:05:19,882 INFO L85 PathProgramCache]: Analyzing trace with hash 21489027, now seen corresponding path program 1 times [2024-11-24 00:05:19,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:05:19,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [750526621] [2024-11-24 00:05:19,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:05:19,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:05:19,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:05:19,903 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:05:19,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 00:05:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:05:20,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-24 00:05:20,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:05:20,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:05:20,257 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:05:20,258 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:05:20,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750526621] [2024-11-24 00:05:20,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750526621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:05:20,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:05:20,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-24 00:05:20,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40782399] [2024-11-24 00:05:20,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:05:20,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:05:20,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:05:20,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:05:20,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:05:20,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-11-24 00:05:20,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:20,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:05:20,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-11-24 00:05:20,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:05:21,114 INFO L124 PetriNetUnfolderBase]: 564/1085 cut-off events. [2024-11-24 00:05:21,114 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:05:21,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2036 conditions, 1085 events. 564/1085 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7284 event pairs, 564 based on Foata normal form. 56/760 useless extension candidates. Maximal degree in co-relation 2026. Up to 937 conditions per place. [2024-11-24 00:05:21,136 INFO L140 encePairwiseOnDemand]: 39/62 looper letters, 24 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2024-11-24 00:05:21,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 130 flow [2024-11-24 00:05:21,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:05:21,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:05:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-11-24 00:05:21,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.478494623655914 [2024-11-24 00:05:21,159 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 126 flow. Second operand 3 states and 89 transitions. [2024-11-24 00:05:21,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 130 flow [2024-11-24 00:05:21,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 37 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 00:05:21,172 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 80 flow [2024-11-24 00:05:21,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2024-11-24 00:05:21,181 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -21 predicate places. [2024-11-24 00:05:21,181 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 80 flow [2024-11-24 00:05:21,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:21,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:05:21,182 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-24 00:05:21,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-24 00:05:21,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:05:21,384 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-24 00:05:21,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:05:21,385 INFO L85 PathProgramCache]: Analyzing trace with hash 21489028, now seen corresponding path program 1 times [2024-11-24 00:05:21,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:05:21,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1971119724] [2024-11-24 00:05:21,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:05:21,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:05:21,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:05:21,397 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:05:21,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-24 00:05:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:05:21,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 00:05:21,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:05:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:05:21,676 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:05:21,677 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:05:21,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971119724] [2024-11-24 00:05:21,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971119724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:05:21,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:05:21,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-24 00:05:21,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536013551] [2024-11-24 00:05:21,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:05:21,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:05:21,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:05:21,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:05:21,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:05:21,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-11-24 00:05:21,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:21,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:05:21,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-11-24 00:05:21,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:05:21,920 INFO L124 PetriNetUnfolderBase]: 180/392 cut-off events. [2024-11-24 00:05:21,921 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:05:21,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 392 events. 180/392 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2259 event pairs, 180 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 717. Up to 319 conditions per place. [2024-11-24 00:05:21,929 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 17 selfloop transitions, 1 changer transitions 1/31 dead transitions. [2024-11-24 00:05:21,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 106 flow [2024-11-24 00:05:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:05:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:05:21,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-11-24 00:05:21,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3602150537634409 [2024-11-24 00:05:21,931 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 80 flow. Second operand 3 states and 67 transitions. [2024-11-24 00:05:21,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 106 flow [2024-11-24 00:05:21,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 105 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 00:05:21,932 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 67 flow [2024-11-24 00:05:21,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2024-11-24 00:05:21,938 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -26 predicate places. [2024-11-24 00:05:21,938 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 67 flow [2024-11-24 00:05:21,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:21,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:05:21,939 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:05:21,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-24 00:05:22,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:05:22,140 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-24 00:05:22,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:05:22,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1493577562, now seen corresponding path program 1 times [2024-11-24 00:05:22,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:05:22,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [811019483] [2024-11-24 00:05:22,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:05:22,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:05:22,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:05:22,145 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:05:22,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-24 00:05:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:05:22,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-24 00:05:22,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:05:22,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:05:22,393 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:05:22,393 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:05:22,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811019483] [2024-11-24 00:05:22,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811019483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:05:22,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:05:22,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-24 00:05:22,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161533770] [2024-11-24 00:05:22,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:05:22,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:05:22,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:05:22,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:05:22,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:05:22,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-11-24 00:05:22,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:22,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:05:22,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-11-24 00:05:22,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:05:22,640 INFO L124 PetriNetUnfolderBase]: 149/394 cut-off events. [2024-11-24 00:05:22,640 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:05:22,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 394 events. 149/394 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2205 event pairs, 29 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 668. Up to 213 conditions per place. [2024-11-24 00:05:22,644 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 28 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2024-11-24 00:05:22,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 153 flow [2024-11-24 00:05:22,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:05:22,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:05:22,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-11-24 00:05:22,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-11-24 00:05:22,646 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 67 flow. Second operand 3 states and 74 transitions. [2024-11-24 00:05:22,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 153 flow [2024-11-24 00:05:22,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 152 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 00:05:22,649 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 76 flow [2024-11-24 00:05:22,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2024-11-24 00:05:22,650 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -25 predicate places. [2024-11-24 00:05:22,650 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 76 flow [2024-11-24 00:05:22,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:22,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:05:22,651 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:05:22,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-24 00:05:22,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:05:22,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-24 00:05:22,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:05:22,858 INFO L85 PathProgramCache]: Analyzing trace with hash 808985833, now seen corresponding path program 1 times [2024-11-24 00:05:22,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:05:22,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1532817522] [2024-11-24 00:05:22,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:05:22,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:05:22,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:05:22,864 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:05:22,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-24 00:05:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:05:23,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 00:05:23,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:05:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:05:23,194 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:05:23,194 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:05:23,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532817522] [2024-11-24 00:05:23,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532817522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:05:23,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:05:23,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 00:05:23,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884131785] [2024-11-24 00:05:23,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:05:23,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:05:23,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:05:23,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:05:23,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:05:23,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-11-24 00:05:23,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:23,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:05:23,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-11-24 00:05:23,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:05:23,481 INFO L124 PetriNetUnfolderBase]: 139/320 cut-off events. [2024-11-24 00:05:23,481 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-24 00:05:23,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 320 events. 139/320 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1638 event pairs, 55 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 652. Up to 194 conditions per place. [2024-11-24 00:05:23,485 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 27 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2024-11-24 00:05:23,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 156 flow [2024-11-24 00:05:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:05:23,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-24 00:05:23,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-11-24 00:05:23,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3467741935483871 [2024-11-24 00:05:23,487 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 76 flow. Second operand 4 states and 86 transitions. [2024-11-24 00:05:23,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 156 flow [2024-11-24 00:05:23,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 00:05:23,490 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 72 flow [2024-11-24 00:05:23,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2024-11-24 00:05:23,491 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -25 predicate places. [2024-11-24 00:05:23,492 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 72 flow [2024-11-24 00:05:23,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:23,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:05:23,493 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:05:23,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-24 00:05:23,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:05:23,697 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-24 00:05:23,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:05:23,697 INFO L85 PathProgramCache]: Analyzing trace with hash 808985834, now seen corresponding path program 1 times [2024-11-24 00:05:23,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:05:23,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [529826586] [2024-11-24 00:05:23,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:05:23,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:05:23,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:05:23,705 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:05:23,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-24 00:05:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:05:23,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-24 00:05:23,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:05:24,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:05:24,130 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:05:24,131 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:05:24,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529826586] [2024-11-24 00:05:24,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529826586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:05:24,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:05:24,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 00:05:24,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814264953] [2024-11-24 00:05:24,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:05:24,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:05:24,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:05:24,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:05:24,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:05:24,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-11-24 00:05:24,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:24,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:05:24,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-11-24 00:05:24,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:05:24,437 INFO L124 PetriNetUnfolderBase]: 129/302 cut-off events. [2024-11-24 00:05:24,437 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-24 00:05:24,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 302 events. 129/302 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1521 event pairs, 45 based on Foata normal form. 8/299 useless extension candidates. Maximal degree in co-relation 608. Up to 176 conditions per place. [2024-11-24 00:05:24,441 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 26 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2024-11-24 00:05:24,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 150 flow [2024-11-24 00:05:24,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:05:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-24 00:05:24,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2024-11-24 00:05:24,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34274193548387094 [2024-11-24 00:05:24,445 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 72 flow. Second operand 4 states and 85 transitions. [2024-11-24 00:05:24,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 150 flow [2024-11-24 00:05:24,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 145 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-24 00:05:24,446 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 67 flow [2024-11-24 00:05:24,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=67, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2024-11-24 00:05:24,447 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -26 predicate places. [2024-11-24 00:05:24,447 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 67 flow [2024-11-24 00:05:24,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:24,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:05:24,447 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:05:24,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-24 00:05:24,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:05:24,654 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-24 00:05:24,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:05:24,654 INFO L85 PathProgramCache]: Analyzing trace with hash 43123041, now seen corresponding path program 1 times [2024-11-24 00:05:24,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:05:24,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1636984593] [2024-11-24 00:05:24,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:05:24,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:05:24,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:05:24,658 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:05:24,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-24 00:05:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:05:24,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-24 00:05:24,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:05:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:05:24,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:05:24,881 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:05:24,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636984593] [2024-11-24 00:05:24,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636984593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:05:24,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:05:24,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-24 00:05:24,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706878578] [2024-11-24 00:05:24,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:05:24,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:05:24,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:05:24,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:05:24,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:05:24,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 62 [2024-11-24 00:05:24,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:24,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:05:24,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 62 [2024-11-24 00:05:24,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:05:25,044 INFO L124 PetriNetUnfolderBase]: 129/293 cut-off events. [2024-11-24 00:05:25,045 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-24 00:05:25,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 293 events. 129/293 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1547 event pairs, 129 based on Foata normal form. 12/295 useless extension candidates. Maximal degree in co-relation 599. Up to 232 conditions per place. [2024-11-24 00:05:25,047 INFO L140 encePairwiseOnDemand]: 60/62 looper letters, 14 selfloop transitions, 1 changer transitions 1/27 dead transitions. [2024-11-24 00:05:25,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 27 transitions, 97 flow [2024-11-24 00:05:25,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:05:25,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:05:25,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-11-24 00:05:25,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3010752688172043 [2024-11-24 00:05:25,049 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 67 flow. Second operand 3 states and 56 transitions. [2024-11-24 00:05:25,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 27 transitions, 97 flow [2024-11-24 00:05:25,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 27 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 00:05:25,050 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 62 flow [2024-11-24 00:05:25,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2024-11-24 00:05:25,053 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -27 predicate places. [2024-11-24 00:05:25,054 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 62 flow [2024-11-24 00:05:25,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:25,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:05:25,054 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:05:25,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-24 00:05:25,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:05:25,255 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-24 00:05:25,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:05:25,256 INFO L85 PathProgramCache]: Analyzing trace with hash 43122409, now seen corresponding path program 1 times [2024-11-24 00:05:25,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:05:25,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1570074107] [2024-11-24 00:05:25,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:05:25,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:05:25,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:05:25,259 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:05:25,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-24 00:05:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:05:25,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-24 00:05:25,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:05:25,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:05:25,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:05:25,505 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:05:25,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570074107] [2024-11-24 00:05:25,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570074107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:05:25,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:05:25,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:05:25,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854711593] [2024-11-24 00:05:25,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:05:25,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:05:25,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:05:25,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:05:25,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:05:25,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2024-11-24 00:05:25,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:25,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:05:25,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2024-11-24 00:05:25,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:05:25,773 INFO L124 PetriNetUnfolderBase]: 180/382 cut-off events. [2024-11-24 00:05:25,773 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:05:25,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 382 events. 180/382 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1757 event pairs, 24 based on Foata normal form. 20/397 useless extension candidates. Maximal degree in co-relation 781. Up to 199 conditions per place. [2024-11-24 00:05:25,776 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 29 selfloop transitions, 4 changer transitions 1/42 dead transitions. [2024-11-24 00:05:25,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 168 flow [2024-11-24 00:05:25,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:05:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-24 00:05:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2024-11-24 00:05:25,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-11-24 00:05:25,778 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 62 flow. Second operand 4 states and 80 transitions. [2024-11-24 00:05:25,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 168 flow [2024-11-24 00:05:25,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 00:05:25,780 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 87 flow [2024-11-24 00:05:25,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2024-11-24 00:05:25,781 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -24 predicate places. [2024-11-24 00:05:25,781 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 87 flow [2024-11-24 00:05:25,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:25,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:05:25,781 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:05:25,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-24 00:05:25,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:05:25,986 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-24 00:05:25,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:05:25,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1755103979, now seen corresponding path program 1 times [2024-11-24 00:05:25,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:05:25,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2021204209] [2024-11-24 00:05:25,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:05:25,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:05:25,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:05:25,992 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:05:25,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-24 00:05:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:05:26,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 00:05:26,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:05:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:05:26,243 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:05:26,243 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:05:26,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021204209] [2024-11-24 00:05:26,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021204209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:05:26,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:05:26,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 00:05:26,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692601670] [2024-11-24 00:05:26,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:05:26,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:05:26,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:05:26,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:05:26,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:05:26,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2024-11-24 00:05:26,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:26,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:05:26,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2024-11-24 00:05:26,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:05:26,476 INFO L124 PetriNetUnfolderBase]: 88/194 cut-off events. [2024-11-24 00:05:26,477 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2024-11-24 00:05:26,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 194 events. 88/194 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 616 event pairs, 16 based on Foata normal form. 14/203 useless extension candidates. Maximal degree in co-relation 477. Up to 71 conditions per place. [2024-11-24 00:05:26,478 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 25 selfloop transitions, 6 changer transitions 1/40 dead transitions. [2024-11-24 00:05:26,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 182 flow [2024-11-24 00:05:26,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:05:26,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-24 00:05:26,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2024-11-24 00:05:26,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2870967741935484 [2024-11-24 00:05:26,481 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 87 flow. Second operand 5 states and 89 transitions. [2024-11-24 00:05:26,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 182 flow [2024-11-24 00:05:26,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 173 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-24 00:05:26,485 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 103 flow [2024-11-24 00:05:26,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2024-11-24 00:05:26,486 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -20 predicate places. [2024-11-24 00:05:26,488 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 103 flow [2024-11-24 00:05:26,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:05:26,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:05:26,489 INFO L206 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] [2024-11-24 00:05:26,501 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-24 00:05:26,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:05:26,693 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-24 00:05:26,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:05:26,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1543878033, now seen corresponding path program 1 times [2024-11-24 00:05:26,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:05:26,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1489476710] [2024-11-24 00:05:26,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:05:26,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:05:26,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:05:26,696 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:05:26,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-24 00:05:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:05:26,922 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 00:05:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:05:27,118 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-24 00:05:27,119 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 00:05:27,120 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (53 of 54 remaining) [2024-11-24 00:05:27,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 54 remaining) [2024-11-24 00:05:27,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 54 remaining) [2024-11-24 00:05:27,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 54 remaining) [2024-11-24 00:05:27,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 54 remaining) [2024-11-24 00:05:27,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 54 remaining) [2024-11-24 00:05:27,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 54 remaining) [2024-11-24 00:05:27,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 54 remaining) [2024-11-24 00:05:27,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 54 remaining) [2024-11-24 00:05:27,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 54 remaining) [2024-11-24 00:05:27,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 54 remaining) [2024-11-24 00:05:27,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 54 remaining) [2024-11-24 00:05:27,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 54 remaining) [2024-11-24 00:05:27,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 54 remaining) [2024-11-24 00:05:27,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 54 remaining) [2024-11-24 00:05:27,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 54 remaining) [2024-11-24 00:05:27,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 54 remaining) [2024-11-24 00:05:27,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 54 remaining) [2024-11-24 00:05:27,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 54 remaining) [2024-11-24 00:05:27,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 54 remaining) [2024-11-24 00:05:27,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 54 remaining) [2024-11-24 00:05:27,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 54 remaining) [2024-11-24 00:05:27,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 54 remaining) [2024-11-24 00:05:27,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 54 remaining) [2024-11-24 00:05:27,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 54 remaining) [2024-11-24 00:05:27,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 54 remaining) [2024-11-24 00:05:27,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 54 remaining) [2024-11-24 00:05:27,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 54 remaining) [2024-11-24 00:05:27,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 54 remaining) [2024-11-24 00:05:27,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (24 of 54 remaining) [2024-11-24 00:05:27,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 54 remaining) [2024-11-24 00:05:27,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 54 remaining) [2024-11-24 00:05:27,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 54 remaining) [2024-11-24 00:05:27,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 54 remaining) [2024-11-24 00:05:27,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 54 remaining) [2024-11-24 00:05:27,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 54 remaining) [2024-11-24 00:05:27,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 54 remaining) [2024-11-24 00:05:27,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 54 remaining) [2024-11-24 00:05:27,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 54 remaining) [2024-11-24 00:05:27,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 54 remaining) [2024-11-24 00:05:27,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 54 remaining) [2024-11-24 00:05:27,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 54 remaining) [2024-11-24 00:05:27,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 54 remaining) [2024-11-24 00:05:27,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 54 remaining) [2024-11-24 00:05:27,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 54 remaining) [2024-11-24 00:05:27,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 54 remaining) [2024-11-24 00:05:27,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 54 remaining) [2024-11-24 00:05:27,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 54 remaining) [2024-11-24 00:05:27,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 54 remaining) [2024-11-24 00:05:27,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 54 remaining) [2024-11-24 00:05:27,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 54 remaining) [2024-11-24 00:05:27,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 54 remaining) [2024-11-24 00:05:27,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 54 remaining) [2024-11-24 00:05:27,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 54 remaining) [2024-11-24 00:05:27,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-24 00:05:27,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:05:27,329 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:05:27,414 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-24 00:05:27,414 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 00:05:27,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 12:05:27 BasicIcfg [2024-11-24 00:05:27,421 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 00:05:27,421 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 00:05:27,422 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 00:05:27,422 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 00:05:27,423 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:05:19" (3/4) ... [2024-11-24 00:05:27,425 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-24 00:05:27,426 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 00:05:27,427 INFO L158 Benchmark]: Toolchain (without parser) took 11157.76ms. Allocated memory was 100.7MB in the beginning and 285.2MB in the end (delta: 184.5MB). Free memory was 76.7MB in the beginning and 122.0MB in the end (delta: -45.3MB). Peak memory consumption was 140.5MB. Max. memory is 16.1GB. [2024-11-24 00:05:27,428 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:05:27,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 722.83ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 53.2MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-24 00:05:27,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.13ms. Allocated memory is still 100.7MB. Free memory was 53.2MB in the beginning and 51.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:05:27,429 INFO L158 Benchmark]: Boogie Preprocessor took 111.74ms. Allocated memory is still 100.7MB. Free memory was 51.0MB in the beginning and 47.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:05:27,429 INFO L158 Benchmark]: RCFGBuilder took 2163.71ms. Allocated memory was 100.7MB in the beginning and 218.1MB in the end (delta: 117.4MB). Free memory was 47.8MB in the beginning and 154.3MB in the end (delta: -106.5MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2024-11-24 00:05:27,430 INFO L158 Benchmark]: TraceAbstraction took 8052.28ms. Allocated memory was 218.1MB in the beginning and 285.2MB in the end (delta: 67.1MB). Free memory was 153.4MB in the beginning and 125.1MB in the end (delta: 28.3MB). Peak memory consumption was 88.8MB. Max. memory is 16.1GB. [2024-11-24 00:05:27,430 INFO L158 Benchmark]: Witness Printer took 4.75ms. Allocated memory is still 285.2MB. Free memory was 125.1MB in the beginning and 122.0MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 00:05:27,433 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.58ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 722.83ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 53.2MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.13ms. Allocated memory is still 100.7MB. Free memory was 53.2MB in the beginning and 51.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 111.74ms. Allocated memory is still 100.7MB. Free memory was 51.0MB in the beginning and 47.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2163.71ms. Allocated memory was 100.7MB in the beginning and 218.1MB in the end (delta: 117.4MB). Free memory was 47.8MB in the beginning and 154.3MB in the end (delta: -106.5MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8052.28ms. Allocated memory was 218.1MB in the beginning and 285.2MB in the end (delta: 67.1MB). Free memory was 153.4MB in the beginning and 125.1MB in the end (delta: 28.3MB). Peak memory consumption was 88.8MB. Max. memory is 16.1GB. * Witness Printer took 4.75ms. Allocated memory is still 285.2MB. Free memory was 125.1MB in the beginning and 122.0MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1921; [L814] FCALL, FORK 0 pthread_create(&t1921, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1921=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] EXPR 1 \read(y) [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L760] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L761] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L762] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L763] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L764] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L765] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L766] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L767] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L768] EXPR 1 \read(y) [L768] 1 __unbuffered_p0_EAX = y [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] EXPR 1 \read(y) [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] 1 y = y$flush_delayed ? y$mem_tmp : y [L770] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L773] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L815] 0 pthread_t t1922; [L816] FCALL, FORK 0 pthread_create(&t1922, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1921=-1, t1922=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L788] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 \read(y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L794] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L795] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921=-1, t1922=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 \read(y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921=-1, t1922=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921=-1, t1922=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L18] 0 __assert_fail ("0", "safe006_power.oepc-thin000_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - 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: -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: -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: -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: -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: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: 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 5 procedures, 99 locations, 54 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: 7.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 310 IncrementalHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 2 mSDtfsCounter, 310 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=0, InterpolantAutomatonStates: 29, 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.3s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 422 SizeOfPredicates, 5 NumberOfNonLiveVariables, 787 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-24 00:05:27,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c748c291-8c64-44ce-8ed4-facf7ae3bf1d/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample