./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU --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 e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:15:00,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:15:00,981 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-31 22:15:00,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:15:00,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:15:01,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:15:01,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:15:01,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:15:01,032 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:15:01,033 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:15:01,034 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:15:01,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:15:01,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:15:01,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:15:01,039 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:15:01,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:15:01,040 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:15:01,040 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:15:01,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:15:01,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:15:01,045 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:15:01,046 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:15:01,046 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:15:01,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:15:01,047 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:15:01,047 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:15:01,048 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:15:01,049 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:15:01,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:15:01,050 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:15:01,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:15:01,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:15:01,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:15:01,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:15:01,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:15:01,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:15:01,054 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:15:01,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:15:01,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:15:01,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:15:01,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:15:01,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:15:01,056 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU 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 -> e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da [2024-10-31 22:15:01,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:15:01,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:15:01,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:15:01,367 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:15:01,367 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:15:01,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i Unable to find full path for "g++" [2024-10-31 22:15:03,410 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:15:03,675 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:15:03,677 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2024-10-31 22:15:03,696 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/data/f8fe8954e/de95c1d4df5e4868a1104551dc9b2f1e/FLAG1e1f4dcc8 [2024-10-31 22:15:03,716 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/data/f8fe8954e/de95c1d4df5e4868a1104551dc9b2f1e [2024-10-31 22:15:03,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:15:03,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:15:03,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:15:03,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:15:03,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:15:03,730 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:15:03" (1/1) ... [2024-10-31 22:15:03,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1525aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:03, skipping insertion in model container [2024-10-31 22:15:03,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:15:03" (1/1) ... [2024-10-31 22:15:03,802 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:15:04,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:15:04,386 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:15:04,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:15:04,500 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:15:04,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:04 WrapperNode [2024-10-31 22:15:04,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:15:04,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:15:04,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:15:04,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:15:04,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:04" (1/1) ... [2024-10-31 22:15:04,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:04" (1/1) ... [2024-10-31 22:15:04,573 INFO L138 Inliner]: procedures = 175, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 148 [2024-10-31 22:15:04,576 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:15:04,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:15:04,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:15:04,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:15:04,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:04" (1/1) ... [2024-10-31 22:15:04,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:04" (1/1) ... [2024-10-31 22:15:04,596 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:04" (1/1) ... [2024-10-31 22:15:04,628 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:15:04,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:04" (1/1) ... [2024-10-31 22:15:04,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:04" (1/1) ... [2024-10-31 22:15:04,645 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:04" (1/1) ... [2024-10-31 22:15:04,648 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:04" (1/1) ... [2024-10-31 22:15:04,650 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:04" (1/1) ... [2024-10-31 22:15:04,655 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:04" (1/1) ... [2024-10-31 22:15:04,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:15:04,661 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:15:04,661 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:15:04,661 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:15:04,662 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:04" (1/1) ... [2024-10-31 22:15:04,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:15:04,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:04,705 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:04,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:15:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-31 22:15:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:15:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-31 22:15:04,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-31 22:15:04,747 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-31 22:15:04,747 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-31 22:15:04,747 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-31 22:15:04,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-31 22:15:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:15:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-31 22:15:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:15:04,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:15:04,752 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:15:04,978 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:15:04,980 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:15:05,384 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:15:05,384 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:15:05,624 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:15:05,624 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 22:15:05,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:15:05 BoogieIcfgContainer [2024-10-31 22:15:05,625 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:15:05,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:15:05,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:15:05,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:15:05,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:15:03" (1/3) ... [2024-10-31 22:15:05,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7318a6bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:15:05, skipping insertion in model container [2024-10-31 22:15:05,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:04" (2/3) ... [2024-10-31 22:15:05,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7318a6bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:15:05, skipping insertion in model container [2024-10-31 22:15:05,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:15:05" (3/3) ... [2024-10-31 22:15:05,633 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2024-10-31 22:15:05,656 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:15:05,657 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-31 22:15:05,657 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:15:05,719 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 22:15:05,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 48 transitions, 108 flow [2024-10-31 22:15:05,792 INFO L124 PetriNetUnfolderBase]: 2/45 cut-off events. [2024-10-31 22:15:05,793 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:15:05,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 45 events. 2/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-10-31 22:15:05,797 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 48 transitions, 108 flow [2024-10-31 22:15:05,801 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 45 transitions, 99 flow [2024-10-31 22:15:05,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:15:05,817 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;@262a56a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:15:05,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-31 22:15:05,822 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:15:05,823 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2024-10-31 22:15:05,823 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:15:05,823 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:15:05,824 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-31 22:15:05,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:15:05,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:05,830 INFO L85 PathProgramCache]: Analyzing trace with hash -908162856, now seen corresponding path program 1 times [2024-10-31 22:15:05,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:05,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532734019] [2024-10-31 22:15:05,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:05,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:15:06,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:06,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532734019] [2024-10-31 22:15:06,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532734019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:06,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:06,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:15:06,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979780104] [2024-10-31 22:15:06,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:06,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:15:06,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:06,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:15:06,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:15:06,507 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 48 [2024-10-31 22:15:06,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-10-31 22:15:06,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:15:06,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 48 [2024-10-31 22:15:06,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:15:07,147 INFO L124 PetriNetUnfolderBase]: 678/1316 cut-off events. [2024-10-31 22:15:07,147 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-31 22:15:07,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2386 conditions, 1316 events. 678/1316 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8350 event pairs, 216 based on Foata normal form. 72/1361 useless extension candidates. Maximal degree in co-relation 2375. Up to 832 conditions per place. [2024-10-31 22:15:07,175 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 31 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2024-10-31 22:15:07,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 55 transitions, 192 flow [2024-10-31 22:15:07,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:15:07,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:15:07,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-10-31 22:15:07,197 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2024-10-31 22:15:07,200 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 99 flow. Second operand 3 states and 109 transitions. [2024-10-31 22:15:07,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 55 transitions, 192 flow [2024-10-31 22:15:07,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-31 22:15:07,211 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 90 flow [2024-10-31 22:15:07,213 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2024-10-31 22:15:07,223 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-10-31 22:15:07,223 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 90 flow [2024-10-31 22:15:07,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-10-31 22:15:07,223 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:15:07,224 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:07,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:15:07,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:15:07,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:07,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1043602731, now seen corresponding path program 1 times [2024-10-31 22:15:07,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:07,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543183073] [2024-10-31 22:15:07,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:07,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:15:07,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:07,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543183073] [2024-10-31 22:15:07,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543183073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:07,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:07,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:15:07,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331578748] [2024-10-31 22:15:07,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:07,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:15:07,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:07,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:15:07,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:15:07,431 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 48 [2024-10-31 22:15:07,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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-10-31 22:15:07,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:15:07,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 48 [2024-10-31 22:15:07,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:15:07,834 INFO L124 PetriNetUnfolderBase]: 603/1157 cut-off events. [2024-10-31 22:15:07,834 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-10-31 22:15:07,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2193 conditions, 1157 events. 603/1157 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7527 event pairs, 603 based on Foata normal form. 36/1115 useless extension candidates. Maximal degree in co-relation 2183. Up to 922 conditions per place. [2024-10-31 22:15:07,844 INFO L140 encePairwiseOnDemand]: 46/48 looper letters, 18 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-10-31 22:15:07,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 128 flow [2024-10-31 22:15:07,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:15:07,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:15:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-10-31 22:15:07,849 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2024-10-31 22:15:07,850 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 90 flow. Second operand 3 states and 87 transitions. [2024-10-31 22:15:07,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 128 flow [2024-10-31 22:15:07,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:15:07,853 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 84 flow [2024-10-31 22:15:07,855 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-10-31 22:15:07,856 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2024-10-31 22:15:07,856 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 84 flow [2024-10-31 22:15:07,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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-10-31 22:15:07,857 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:15:07,857 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:07,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:15:07,857 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:15:07,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:07,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1043604221, now seen corresponding path program 1 times [2024-10-31 22:15:07,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:07,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476672261] [2024-10-31 22:15:07,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:07,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:15:08,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:08,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476672261] [2024-10-31 22:15:08,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476672261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:08,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:08,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:15:08,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140125839] [2024-10-31 22:15:08,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:08,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:15:08,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:08,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:15:08,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:15:08,346 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-10-31 22:15:08,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 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-10-31 22:15:08,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:15:08,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-10-31 22:15:08,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:15:09,058 INFO L124 PetriNetUnfolderBase]: 865/1581 cut-off events. [2024-10-31 22:15:09,058 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:15:09,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2948 conditions, 1581 events. 865/1581 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10423 event pairs, 187 based on Foata normal form. 0/1509 useless extension candidates. Maximal degree in co-relation 2942. Up to 625 conditions per place. [2024-10-31 22:15:09,068 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 27 selfloop transitions, 2 changer transitions 36/82 dead transitions. [2024-10-31 22:15:09,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 82 transitions, 304 flow [2024-10-31 22:15:09,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:15:09,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-31 22:15:09,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 235 transitions. [2024-10-31 22:15:09,072 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6119791666666666 [2024-10-31 22:15:09,074 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 84 flow. Second operand 8 states and 235 transitions. [2024-10-31 22:15:09,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 82 transitions, 304 flow [2024-10-31 22:15:09,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 303 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:15:09,078 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 97 flow [2024-10-31 22:15:09,078 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=97, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2024-10-31 22:15:09,080 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2024-10-31 22:15:09,080 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 97 flow [2024-10-31 22:15:09,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 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-10-31 22:15:09,081 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:15:09,081 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:09,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:15:09,082 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:15:09,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:09,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1737932176, now seen corresponding path program 1 times [2024-10-31 22:15:09,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:09,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978708985] [2024-10-31 22:15:09,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:09,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:09,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:15:09,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:09,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978708985] [2024-10-31 22:15:09,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978708985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:09,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:09,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:15:09,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22960993] [2024-10-31 22:15:09,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:09,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:15:09,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:09,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:15:09,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:15:09,880 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-10-31 22:15:09,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 37 transitions, 97 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 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-10-31 22:15:09,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:15:09,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-10-31 22:15:09,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:15:10,671 INFO L124 PetriNetUnfolderBase]: 1327/2250 cut-off events. [2024-10-31 22:15:10,671 INFO L125 PetriNetUnfolderBase]: For 528/528 co-relation queries the response was YES. [2024-10-31 22:15:10,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4802 conditions, 2250 events. 1327/2250 cut-off events. For 528/528 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13642 event pairs, 257 based on Foata normal form. 60/2271 useless extension candidates. Maximal degree in co-relation 4790. Up to 1393 conditions per place. [2024-10-31 22:15:10,687 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 31 selfloop transitions, 2 changer transitions 31/78 dead transitions. [2024-10-31 22:15:10,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 78 transitions, 320 flow [2024-10-31 22:15:10,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:15:10,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-31 22:15:10,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions. [2024-10-31 22:15:10,689 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-10-31 22:15:10,689 INFO L175 Difference]: Start difference. First operand has 58 places, 37 transitions, 97 flow. Second operand 7 states and 192 transitions. [2024-10-31 22:15:10,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 78 transitions, 320 flow [2024-10-31 22:15:10,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 78 transitions, 298 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-10-31 22:15:10,711 INFO L231 Difference]: Finished difference. Result has 57 places, 37 transitions, 101 flow [2024-10-31 22:15:10,712 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=101, PETRI_PLACES=57, PETRI_TRANSITIONS=37} [2024-10-31 22:15:10,713 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2024-10-31 22:15:10,714 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 37 transitions, 101 flow [2024-10-31 22:15:10,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 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-10-31 22:15:10,715 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:15:10,715 INFO L204 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-10-31 22:15:10,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:15:10,716 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:15:10,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:10,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1163062954, now seen corresponding path program 1 times [2024-10-31 22:15:10,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:10,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325053565] [2024-10-31 22:15:10,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:10,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:11,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:15:11,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:11,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325053565] [2024-10-31 22:15:11,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325053565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:11,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:11,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:15:11,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724614380] [2024-10-31 22:15:11,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:11,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:15:11,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:11,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:15:11,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:15:11,757 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-10-31 22:15:11,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 37 transitions, 101 flow. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 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-10-31 22:15:11,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:15:11,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-10-31 22:15:11,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:15:12,484 INFO L124 PetriNetUnfolderBase]: 782/1550 cut-off events. [2024-10-31 22:15:12,485 INFO L125 PetriNetUnfolderBase]: For 347/356 co-relation queries the response was YES. [2024-10-31 22:15:12,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3157 conditions, 1550 events. 782/1550 cut-off events. For 347/356 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10130 event pairs, 222 based on Foata normal form. 41/1579 useless extension candidates. Maximal degree in co-relation 3144. Up to 952 conditions per place. [2024-10-31 22:15:12,508 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 34 selfloop transitions, 6 changer transitions 25/82 dead transitions. [2024-10-31 22:15:12,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 82 transitions, 339 flow [2024-10-31 22:15:12,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:15:12,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-31 22:15:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 235 transitions. [2024-10-31 22:15:12,510 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6119791666666666 [2024-10-31 22:15:12,510 INFO L175 Difference]: Start difference. First operand has 57 places, 37 transitions, 101 flow. Second operand 8 states and 235 transitions. [2024-10-31 22:15:12,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 82 transitions, 339 flow [2024-10-31 22:15:12,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 82 transitions, 319 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-10-31 22:15:12,523 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 144 flow [2024-10-31 22:15:12,524 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=144, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2024-10-31 22:15:12,524 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2024-10-31 22:15:12,525 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 144 flow [2024-10-31 22:15:12,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 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-10-31 22:15:12,525 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:15:12,525 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:12,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:15:12,526 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:15:12,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:12,527 INFO L85 PathProgramCache]: Analyzing trace with hash 768480941, now seen corresponding path program 1 times [2024-10-31 22:15:12,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:12,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932836231] [2024-10-31 22:15:12,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:12,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:12,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:15:12,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:12,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932836231] [2024-10-31 22:15:12,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932836231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:12,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:12,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:15:12,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886269912] [2024-10-31 22:15:12,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:12,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:15:12,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:12,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:15:12,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:15:12,796 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-10-31 22:15:12,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 42 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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-10-31 22:15:12,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:15:12,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-10-31 22:15:12,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:15:13,371 INFO L124 PetriNetUnfolderBase]: 1466/2463 cut-off events. [2024-10-31 22:15:13,371 INFO L125 PetriNetUnfolderBase]: For 2094/2094 co-relation queries the response was YES. [2024-10-31 22:15:13,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6398 conditions, 2463 events. 1466/2463 cut-off events. For 2094/2094 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 14446 event pairs, 170 based on Foata normal form. 99/2451 useless extension candidates. Maximal degree in co-relation 6383. Up to 1366 conditions per place. [2024-10-31 22:15:13,390 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 48 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2024-10-31 22:15:13,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 69 transitions, 350 flow [2024-10-31 22:15:13,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:15:13,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:15:13,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2024-10-31 22:15:13,392 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-10-31 22:15:13,392 INFO L175 Difference]: Start difference. First operand has 60 places, 42 transitions, 144 flow. Second operand 4 states and 124 transitions. [2024-10-31 22:15:13,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 69 transitions, 350 flow [2024-10-31 22:15:13,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 69 transitions, 346 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-31 22:15:13,397 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 178 flow [2024-10-31 22:15:13,397 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2024-10-31 22:15:13,398 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2024-10-31 22:15:13,398 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 178 flow [2024-10-31 22:15:13,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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-10-31 22:15:13,398 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:15:13,399 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:13,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:15:13,399 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:15:13,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:13,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1227980713, now seen corresponding path program 1 times [2024-10-31 22:15:13,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:13,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780415528] [2024-10-31 22:15:13,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:13,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:13,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:15:13,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:13,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780415528] [2024-10-31 22:15:13,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780415528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:13,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:13,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:15:13,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694086769] [2024-10-31 22:15:13,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:13,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:15:13,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:13,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:15:13,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:15:13,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-10-31 22:15:13,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:15:13,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:15:13,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-10-31 22:15:13,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:15:14,194 INFO L124 PetriNetUnfolderBase]: 1088/1881 cut-off events. [2024-10-31 22:15:14,195 INFO L125 PetriNetUnfolderBase]: For 1939/1939 co-relation queries the response was YES. [2024-10-31 22:15:14,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5359 conditions, 1881 events. 1088/1881 cut-off events. For 1939/1939 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10212 event pairs, 119 based on Foata normal form. 82/1863 useless extension candidates. Maximal degree in co-relation 5342. Up to 637 conditions per place. [2024-10-31 22:15:14,208 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 57 selfloop transitions, 8 changer transitions 0/81 dead transitions. [2024-10-31 22:15:14,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 81 transitions, 448 flow [2024-10-31 22:15:14,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:15:14,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-31 22:15:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2024-10-31 22:15:14,210 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6541666666666667 [2024-10-31 22:15:14,210 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 178 flow. Second operand 5 states and 157 transitions. [2024-10-31 22:15:14,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 81 transitions, 448 flow [2024-10-31 22:15:14,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 81 transitions, 445 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:15:14,215 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 230 flow [2024-10-31 22:15:14,215 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2024-10-31 22:15:14,216 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2024-10-31 22:15:14,216 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 230 flow [2024-10-31 22:15:14,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:15:14,217 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:15:14,217 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:14,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:15:14,218 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:15:14,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:14,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1467459970, now seen corresponding path program 1 times [2024-10-31 22:15:14,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:14,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310746657] [2024-10-31 22:15:14,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:14,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:15:14,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:14,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310746657] [2024-10-31 22:15:14,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310746657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:14,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:14,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:15:14,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324846671] [2024-10-31 22:15:14,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:14,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:15:14,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:14,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:15:14,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:15:14,536 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-10-31 22:15:14,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 50 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 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-10-31 22:15:14,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:15:14,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-10-31 22:15:14,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:15:14,993 INFO L124 PetriNetUnfolderBase]: 816/1413 cut-off events. [2024-10-31 22:15:14,993 INFO L125 PetriNetUnfolderBase]: For 2666/2666 co-relation queries the response was YES. [2024-10-31 22:15:14,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4555 conditions, 1413 events. 816/1413 cut-off events. For 2666/2666 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7470 event pairs, 119 based on Foata normal form. 40/1353 useless extension candidates. Maximal degree in co-relation 4535. Up to 475 conditions per place. [2024-10-31 22:15:15,003 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 52 selfloop transitions, 11 changer transitions 0/79 dead transitions. [2024-10-31 22:15:15,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 79 transitions, 460 flow [2024-10-31 22:15:15,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:15:15,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:15:15,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2024-10-31 22:15:15,005 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2024-10-31 22:15:15,005 INFO L175 Difference]: Start difference. First operand has 64 places, 50 transitions, 230 flow. Second operand 6 states and 174 transitions. [2024-10-31 22:15:15,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 79 transitions, 460 flow [2024-10-31 22:15:15,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 79 transitions, 433 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-10-31 22:15:15,011 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 248 flow [2024-10-31 22:15:15,011 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2024-10-31 22:15:15,012 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 14 predicate places. [2024-10-31 22:15:15,012 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 248 flow [2024-10-31 22:15:15,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 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-10-31 22:15:15,013 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:15:15,013 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:15,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:15:15,014 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:15:15,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:15,014 INFO L85 PathProgramCache]: Analyzing trace with hash -230795349, now seen corresponding path program 1 times [2024-10-31 22:15:15,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:15,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675942021] [2024-10-31 22:15:15,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:15,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:15,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:15:15,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:15,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675942021] [2024-10-31 22:15:15,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675942021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:15,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:15,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:15:15,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784271426] [2024-10-31 22:15:15,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:15,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:15:15,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:15,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:15:15,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:15:15,760 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2024-10-31 22:15:15,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 248 flow. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 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-10-31 22:15:15,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:15:15,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2024-10-31 22:15:15,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:15:16,702 INFO L124 PetriNetUnfolderBase]: 1521/2826 cut-off events. [2024-10-31 22:15:16,702 INFO L125 PetriNetUnfolderBase]: For 3596/4047 co-relation queries the response was YES. [2024-10-31 22:15:16,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7847 conditions, 2826 events. 1521/2826 cut-off events. For 3596/4047 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18610 event pairs, 369 based on Foata normal form. 62/2679 useless extension candidates. Maximal degree in co-relation 7827. Up to 1206 conditions per place. [2024-10-31 22:15:16,728 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 38 selfloop transitions, 4 changer transitions 39/105 dead transitions. [2024-10-31 22:15:16,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 105 transitions, 596 flow [2024-10-31 22:15:16,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:15:16,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-31 22:15:16,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2024-10-31 22:15:16,730 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5442708333333334 [2024-10-31 22:15:16,730 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 248 flow. Second operand 8 states and 209 transitions. [2024-10-31 22:15:16,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 105 transitions, 596 flow [2024-10-31 22:15:16,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 105 transitions, 548 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-10-31 22:15:16,757 INFO L231 Difference]: Finished difference. Result has 75 places, 53 transitions, 256 flow [2024-10-31 22:15:16,757 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=256, PETRI_PLACES=75, PETRI_TRANSITIONS=53} [2024-10-31 22:15:16,758 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 22 predicate places. [2024-10-31 22:15:16,758 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 53 transitions, 256 flow [2024-10-31 22:15:16,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 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-10-31 22:15:16,758 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:15:16,758 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:16,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:15:16,759 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:15:16,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:16,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1647630657, now seen corresponding path program 2 times [2024-10-31 22:15:16,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:16,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163764838] [2024-10-31 22:15:16,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:16,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:15:17,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:17,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163764838] [2024-10-31 22:15:17,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163764838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:17,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:17,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:15:17,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698759925] [2024-10-31 22:15:17,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:17,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:15:17,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:17,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:15:17,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:15:17,124 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-10-31 22:15:17,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 53 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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-10-31 22:15:17,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:15:17,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-10-31 22:15:17,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:15:17,616 INFO L124 PetriNetUnfolderBase]: 934/2008 cut-off events. [2024-10-31 22:15:17,616 INFO L125 PetriNetUnfolderBase]: For 1803/2000 co-relation queries the response was YES. [2024-10-31 22:15:17,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5440 conditions, 2008 events. 934/2008 cut-off events. For 1803/2000 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 14224 event pairs, 310 based on Foata normal form. 37/1853 useless extension candidates. Maximal degree in co-relation 5416. Up to 682 conditions per place. [2024-10-31 22:15:17,654 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 25 selfloop transitions, 1 changer transitions 28/80 dead transitions. [2024-10-31 22:15:17,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 80 transitions, 456 flow [2024-10-31 22:15:17,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:15:17,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:15:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2024-10-31 22:15:17,656 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5763888888888888 [2024-10-31 22:15:17,656 INFO L175 Difference]: Start difference. First operand has 75 places, 53 transitions, 256 flow. Second operand 6 states and 166 transitions. [2024-10-31 22:15:17,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 80 transitions, 456 flow [2024-10-31 22:15:17,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 80 transitions, 444 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-10-31 22:15:17,672 INFO L231 Difference]: Finished difference. Result has 77 places, 49 transitions, 235 flow [2024-10-31 22:15:17,673 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=235, PETRI_PLACES=77, PETRI_TRANSITIONS=49} [2024-10-31 22:15:17,674 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2024-10-31 22:15:17,675 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 49 transitions, 235 flow [2024-10-31 22:15:17,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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-10-31 22:15:17,676 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:15:17,676 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:17,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:15:17,677 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:15:17,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:17,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1384257803, now seen corresponding path program 3 times [2024-10-31 22:15:17,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:17,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592850099] [2024-10-31 22:15:17,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:17,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:17,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:15:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:17,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:15:17,950 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:15:17,951 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-10-31 22:15:17,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-10-31 22:15:17,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-10-31 22:15:17,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-31 22:15:17,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-31 22:15:17,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-31 22:15:17,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-31 22:15:17,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:15:17,955 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:18,069 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-31 22:15:18,073 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:15:18,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:15:18 BasicIcfg [2024-10-31 22:15:18,081 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:15:18,081 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:15:18,082 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:15:18,082 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:15:18,082 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:15:05" (3/4) ... [2024-10-31 22:15:18,084 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:15:18,085 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:15:18,086 INFO L158 Benchmark]: Toolchain (without parser) took 14364.86ms. Allocated memory was 174.1MB in the beginning and 415.2MB in the end (delta: 241.2MB). Free memory was 135.5MB in the beginning and 292.4MB in the end (delta: -157.0MB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. [2024-10-31 22:15:18,086 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 134.2MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:15:18,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 778.22ms. Allocated memory is still 174.1MB. Free memory was 135.1MB in the beginning and 109.4MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-31 22:15:18,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.75ms. Allocated memory is still 174.1MB. Free memory was 109.0MB in the beginning and 106.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:15:18,088 INFO L158 Benchmark]: Boogie Preprocessor took 82.90ms. Allocated memory is still 174.1MB. Free memory was 106.1MB in the beginning and 102.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:15:18,089 INFO L158 Benchmark]: RCFGBuilder took 964.24ms. Allocated memory is still 174.1MB. Free memory was 102.8MB in the beginning and 102.7MB in the end (delta: 81.9kB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2024-10-31 22:15:18,090 INFO L158 Benchmark]: TraceAbstraction took 12453.98ms. Allocated memory was 174.1MB in the beginning and 415.2MB in the end (delta: 241.2MB). Free memory was 102.0MB in the beginning and 293.5MB in the end (delta: -191.5MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2024-10-31 22:15:18,090 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 415.2MB. Free memory was 293.5MB in the beginning and 292.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:15:18,092 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.31ms. Allocated memory is still 134.2MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 778.22ms. Allocated memory is still 174.1MB. Free memory was 135.1MB in the beginning and 109.4MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.75ms. Allocated memory is still 174.1MB. Free memory was 109.0MB in the beginning and 106.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.90ms. Allocated memory is still 174.1MB. Free memory was 106.1MB in the beginning and 102.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 964.24ms. Allocated memory is still 174.1MB. Free memory was 102.8MB in the beginning and 102.7MB in the end (delta: 81.9kB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12453.98ms. Allocated memory was 174.1MB in the beginning and 415.2MB in the end (delta: 241.2MB). Free memory was 102.0MB in the beginning and 293.5MB in the end (delta: -191.5MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 415.2MB. Free memory was 293.5MB in the beginning and 292.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$read_delayed; [L737] 0 int *x$read_delayed_var; [L738] 0 int x$w_buff0; [L739] 0 _Bool x$w_buff0_used; [L740] 0 int x$w_buff1; [L741] 0 _Bool x$w_buff1_used; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L840] 0 pthread_t t891; [L841] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L842] 0 pthread_t t892; [L843] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891=0, t892=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 2 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L844] 0 pthread_t t893; [L845] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891=0, t892=1, t893=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L809] 3 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L812] 3 __unbuffered_p2_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L815] 3 __unbuffered_p2_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L751] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L757] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L818] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L821] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891=0, t892=1, t893=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L849] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L849] RET 0 assume_abort_if_not(main$tmp_guard0) [L851] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L852] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L854] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891=0, t892=1, t893=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 x$flush_delayed = weak$$choice2 [L861] 0 x$mem_tmp = x [L862] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L863] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L864] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L865] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L866] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L868] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] 0 x = x$flush_delayed ? x$mem_tmp : x [L871] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891=0, t892=1, t893=2, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix033_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 843]: 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: 845]: 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: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 76 locations, 7 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: 12.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 397 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 382 mSDsluCounter, 116 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1064 IncrementalHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 21 mSDtfsCounter, 1064 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256occurred in iteration=9, InterpolantAutomatonStates: 58, 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.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 970 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-31 22:15:18,131 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU --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 e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:15:20,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:15:20,879 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-31 22:15:20,888 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:15:20,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:15:20,923 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:15:20,925 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:15:20,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:15:20,927 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:15:20,928 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:15:20,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:15:20,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:15:20,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:15:20,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:15:20,932 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:15:20,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:15:20,933 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:15:20,933 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:15:20,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:15:20,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:15:20,937 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:15:20,938 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:15:20,938 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:15:20,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:15:20,939 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:15:20,939 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:15:20,939 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:15:20,940 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:15:20,940 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:15:20,940 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:15:20,941 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:15:20,941 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:15:20,941 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:15:20,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:15:20,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:15:20,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:15:20,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:15:20,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:15:20,944 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:15:20,945 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:15:20,945 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:15:20,945 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:15:20,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:15:20,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:15:20,946 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:15:20,947 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU 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 -> e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da [2024-10-31 22:15:21,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:15:21,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:15:21,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:15:21,413 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:15:21,413 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:15:21,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i Unable to find full path for "g++" [2024-10-31 22:15:23,677 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:15:24,006 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:15:24,007 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2024-10-31 22:15:24,034 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/data/f6aae02a8/4ea4761a18674da69309da1721987427/FLAGeefa276ac [2024-10-31 22:15:24,255 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/data/f6aae02a8/4ea4761a18674da69309da1721987427 [2024-10-31 22:15:24,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:15:24,258 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:15:24,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:15:24,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:15:24,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:15:24,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:15:24" (1/1) ... [2024-10-31 22:15:24,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf68c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:24, skipping insertion in model container [2024-10-31 22:15:24,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:15:24" (1/1) ... [2024-10-31 22:15:24,338 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:15:24,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:15:24,946 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:15:25,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:15:25,136 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:15:25,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:25 WrapperNode [2024-10-31 22:15:25,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:15:25,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:15:25,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:15:25,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:15:25,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:25" (1/1) ... [2024-10-31 22:15:25,187 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:25" (1/1) ... [2024-10-31 22:15:25,229 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2024-10-31 22:15:25,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:15:25,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:15:25,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:15:25,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:15:25,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:25" (1/1) ... [2024-10-31 22:15:25,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:25" (1/1) ... [2024-10-31 22:15:25,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:25" (1/1) ... [2024-10-31 22:15:25,288 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:15:25,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:25" (1/1) ... [2024-10-31 22:15:25,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:25" (1/1) ... [2024-10-31 22:15:25,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:25" (1/1) ... [2024-10-31 22:15:25,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:25" (1/1) ... [2024-10-31 22:15:25,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:25" (1/1) ... [2024-10-31 22:15:25,316 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:25" (1/1) ... [2024-10-31 22:15:25,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:15:25,324 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:15:25,324 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:15:25,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:15:25,325 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:25" (1/1) ... [2024-10-31 22:15:25,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:15:25,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:25,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:25,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:15:25,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-31 22:15:25,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:15:25,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 22:15:25,395 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-31 22:15:25,395 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-31 22:15:25,395 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-31 22:15:25,395 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-31 22:15:25,396 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-31 22:15:25,396 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-31 22:15:25,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-31 22:15:25,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:15:25,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:15:25,398 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:15:25,596 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:15:25,599 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:15:26,043 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:15:26,043 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:15:26,491 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:15:26,492 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 22:15:26,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:15:26 BoogieIcfgContainer [2024-10-31 22:15:26,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:15:26,497 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:15:26,497 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:15:26,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:15:26,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:15:24" (1/3) ... [2024-10-31 22:15:26,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5faa0921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:15:26, skipping insertion in model container [2024-10-31 22:15:26,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:25" (2/3) ... [2024-10-31 22:15:26,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5faa0921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:15:26, skipping insertion in model container [2024-10-31 22:15:26,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:15:26" (3/3) ... [2024-10-31 22:15:26,507 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2024-10-31 22:15:26,528 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:15:26,528 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-31 22:15:26,528 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:15:26,602 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 22:15:26,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 48 transitions, 108 flow [2024-10-31 22:15:26,694 INFO L124 PetriNetUnfolderBase]: 2/45 cut-off events. [2024-10-31 22:15:26,694 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:15:26,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 45 events. 2/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 91 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-10-31 22:15:26,699 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 48 transitions, 108 flow [2024-10-31 22:15:26,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 45 transitions, 99 flow [2024-10-31 22:15:26,721 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:15:26,729 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;@503e1acb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:15:26,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-31 22:15:26,740 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:15:26,741 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2024-10-31 22:15:26,741 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:15:26,741 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:15:26,742 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-31 22:15:26,742 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:15:26,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:26,748 INFO L85 PathProgramCache]: Analyzing trace with hash -847146980, now seen corresponding path program 1 times [2024-10-31 22:15:26,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:15:26,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585359272] [2024-10-31 22:15:26,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:26,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:15:26,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:15:26,766 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:15:26,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-31 22:15:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:26,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-31 22:15:26,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:15:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:15:26,977 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:15:26,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:15:26,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585359272] [2024-10-31 22:15:26,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585359272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:26,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:26,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:15:26,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340784193] [2024-10-31 22:15:26,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:26,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:15:26,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:15:27,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:15:27,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:15:27,032 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 48 [2024-10-31 22:15:27,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-10-31 22:15:27,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:15:27,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 48 [2024-10-31 22:15:27,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:15:27,734 INFO L124 PetriNetUnfolderBase]: 678/1316 cut-off events. [2024-10-31 22:15:27,734 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-31 22:15:27,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2386 conditions, 1316 events. 678/1316 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8383 event pairs, 216 based on Foata normal form. 72/1360 useless extension candidates. Maximal degree in co-relation 2375. Up to 832 conditions per place. [2024-10-31 22:15:27,757 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 31 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2024-10-31 22:15:27,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 55 transitions, 192 flow [2024-10-31 22:15:27,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:15:27,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:15:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-10-31 22:15:27,778 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2024-10-31 22:15:27,781 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 99 flow. Second operand 3 states and 109 transitions. [2024-10-31 22:15:27,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 55 transitions, 192 flow [2024-10-31 22:15:27,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-31 22:15:27,792 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 90 flow [2024-10-31 22:15:27,796 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2024-10-31 22:15:27,803 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-10-31 22:15:27,803 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 90 flow [2024-10-31 22:15:27,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-10-31 22:15:27,804 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:15:27,804 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:27,809 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-31 22:15:28,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:15:28,006 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:15:28,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:28,007 INFO L85 PathProgramCache]: Analyzing trace with hash 470007021, now seen corresponding path program 1 times [2024-10-31 22:15:28,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:15:28,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071084886] [2024-10-31 22:15:28,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:28,009 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:15:28,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:15:28,016 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:15:28,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-31 22:15:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-31 22:15:28,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:15:28,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:15:28,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:15:28,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:15:28,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071084886] [2024-10-31 22:15:28,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071084886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:28,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:28,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:15:28,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592495532] [2024-10-31 22:15:28,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:28,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:15:28,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:15:28,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:15:28,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:15:28,311 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-10-31 22:15:28,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 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-10-31 22:15:28,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:15:28,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-10-31 22:15:28,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:15:29,052 INFO L124 PetriNetUnfolderBase]: 1509/2587 cut-off events. [2024-10-31 22:15:29,053 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2024-10-31 22:15:29,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5055 conditions, 2587 events. 1509/2587 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 16455 event pairs, 147 based on Foata normal form. 80/2578 useless extension candidates. Maximal degree in co-relation 5045. Up to 1513 conditions per place. [2024-10-31 22:15:29,078 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 41 selfloop transitions, 5 changer transitions 1/63 dead transitions. [2024-10-31 22:15:29,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 63 transitions, 238 flow [2024-10-31 22:15:29,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:15:29,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:15:29,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2024-10-31 22:15:29,083 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6510416666666666 [2024-10-31 22:15:29,083 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 90 flow. Second operand 4 states and 125 transitions. [2024-10-31 22:15:29,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 63 transitions, 238 flow [2024-10-31 22:15:29,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 63 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:15:29,091 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 120 flow [2024-10-31 22:15:29,092 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2024-10-31 22:15:29,093 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2024-10-31 22:15:29,093 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 120 flow [2024-10-31 22:15:29,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 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-10-31 22:15:29,095 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:15:29,095 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:29,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-31 22:15:29,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:15:29,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:15:29,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:29,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1920058518, now seen corresponding path program 1 times [2024-10-31 22:15:29,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:15:29,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905277618] [2024-10-31 22:15:29,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:29,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:15:29,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:15:29,304 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:15:29,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e29f5437-2af5-428a-a185-117632b393dc/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-31 22:15:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-31 22:15:29,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:15:29,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:15:29,539 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:15:29,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:15:29,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905277618] [2024-10-31 22:15:29,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905277618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:29,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:29,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:15:29,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921453523] [2024-10-31 22:15:29,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:29,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:15:29,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:15:29,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:15:29,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:15:29,556 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-10-31 22:15:29,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 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-10-31 22:15:29,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:15:29,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-10-31 22:15:29,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand