./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for memory safety (deref-memtrack)
Using default analysis
Version d790fecc
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB --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 15ac4e1d4eb7f123e42f66ffca6b608a72882a0faec253c9cc2d868c4bb280c3
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-d790fec
[2024-11-28 02:29:18,925 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-28 02:29:19,011 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2024-11-28 02:29:19,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-28 02:29:19,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-28 02:29:19,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-28 02:29:19,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-28 02:29:19,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-28 02:29:19,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-28 02:29:19,047 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-28 02:29:19,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-28 02:29:19,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-28 02:29:19,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-28 02:29:19,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-28 02:29:19,048 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-28 02:29:19,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-28 02:29:19,048 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-28 02:29:19,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-28 02:29:19,048 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-28 02:29:19,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-28 02:29:19,049 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-28 02:29:19,049 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-28 02:29:19,049 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-28 02:29:19,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-28 02:29:19,049 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-28 02:29:19,049 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-28 02:29:19,049 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-28 02:29:19,050 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-28 02:29:19,050 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-28 02:29:19,050 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-28 02:29:19,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-28 02:29:19,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-28 02:29:19,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-28 02:29:19,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-28 02:29:19,051 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-28 02:29:19,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-28 02:29:19,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-28 02:29:19,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-28 02:29:19,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-28 02:29:19,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-28 02:29:19,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-28 02:29:19,051 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-28 02:29:19,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-28 02:29:19,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-28 02:29:19,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-28 02:29:19,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-28 02:29:19,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-28 02:29:19,052 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB
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 -> 15ac4e1d4eb7f123e42f66ffca6b608a72882a0faec253c9cc2d868c4bb280c3
[2024-11-28 02:29:19,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-28 02:29:19,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-28 02:29:19,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-28 02:29:19,448 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-28 02:29:19,448 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-28 02:29:19,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i
[2024-11-28 02:29:22,524 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/data/71111e965/c9ae88164d7c449989e8035ad6973091/FLAG9153bd00f
[2024-11-28 02:29:22,916 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-28 02:29:22,917 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i
[2024-11-28 02:29:22,952 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/data/71111e965/c9ae88164d7c449989e8035ad6973091/FLAG9153bd00f
[2024-11-28 02:29:22,974 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/data/71111e965/c9ae88164d7c449989e8035ad6973091
[2024-11-28 02:29:22,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-28 02:29:22,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-28 02:29:22,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-28 02:29:22,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-28 02:29:22,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-28 02:29:22,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:29:22" (1/1) ...
[2024-11-28 02:29:22,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1628c334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:22, skipping insertion in model container
[2024-11-28 02:29:22,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:29:22" (1/1) ...
[2024-11-28 02:29:23,055 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-28 02:29:23,540 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-28 02:29:23,553 INFO L200 MainTranslator]: Completed pre-run
[2024-11-28 02:29:23,651 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-28 02:29:23,686 INFO L204 MainTranslator]: Completed translation
[2024-11-28 02:29:23,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:23 WrapperNode
[2024-11-28 02:29:23,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-28 02:29:23,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-28 02:29:23,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-28 02:29:23,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-28 02:29:23,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:23" (1/1) ...
[2024-11-28 02:29:23,708 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:23" (1/1) ...
[2024-11-28 02:29:23,729 INFO L138 Inliner]: procedures = 174, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115
[2024-11-28 02:29:23,729 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-28 02:29:23,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-28 02:29:23,730 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-28 02:29:23,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-28 02:29:23,740 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:23" (1/1) ...
[2024-11-28 02:29:23,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:23" (1/1) ...
[2024-11-28 02:29:23,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:23" (1/1) ...
[2024-11-28 02:29:23,783 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5].
[2024-11-28 02:29:23,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:23" (1/1) ...
[2024-11-28 02:29:23,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:23" (1/1) ...
[2024-11-28 02:29:23,799 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:23" (1/1) ...
[2024-11-28 02:29:23,803 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:23" (1/1) ...
[2024-11-28 02:29:23,806 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:23" (1/1) ...
[2024-11-28 02:29:23,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:23" (1/1) ...
[2024-11-28 02:29:23,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:23" (1/1) ...
[2024-11-28 02:29:23,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-28 02:29:23,813 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-28 02:29:23,813 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-28 02:29:23,813 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-28 02:29:23,815 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:23" (1/1) ...
[2024-11-28 02:29:23,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-28 02:29:23,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 02:29:23,858 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-28 02:29:23,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-28 02:29:23,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0
[2024-11-28 02:29:23,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1
[2024-11-28 02:29:23,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0
[2024-11-28 02:29:23,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1
[2024-11-28 02:29:23,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-28 02:29:23,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-28 02:29:23,899 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-28 02:29:23,899 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-28 02:29:23,899 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-28 02:29:23,899 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-28 02:29:23,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-28 02:29:23,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-11-28 02:29:23,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-28 02:29:23,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-28 02:29:23,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-28 02:29:23,902 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-28 02:29:24,081 INFO L234 CfgBuilder]: Building ICFG
[2024-11-28 02:29:24,083 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-28 02:29:24,699 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-28 02:29:24,702 INFO L283 CfgBuilder]: Performing block encoding
[2024-11-28 02:29:25,436 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-28 02:29:25,437 INFO L312 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-28 02:29:25,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:29:25 BoogieIcfgContainer
[2024-11-28 02:29:25,437 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-28 02:29:25,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-28 02:29:25,441 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-28 02:29:25,447 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-28 02:29:25,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:29:22" (1/3) ...
[2024-11-28 02:29:25,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48203b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:29:25, skipping insertion in model container
[2024-11-28 02:29:25,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:23" (2/3) ...
[2024-11-28 02:29:25,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48203b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:29:25, skipping insertion in model container
[2024-11-28 02:29:25,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:29:25" (3/3) ...
[2024-11-28 02:29:25,451 INFO L128 eAbstractionObserver]: Analyzing ICFG safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i
[2024-11-28 02:29:25,470 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-28 02:29:25,473 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i that has 3 procedures, 57 locations, 1 initial locations, 0 loop locations, and 26 error locations.
[2024-11-28 02:29:25,473 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-28 02:29:25,642 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-28 02:29:25,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 58 transitions, 124 flow
[2024-11-28 02:29:25,784 INFO L124 PetriNetUnfolderBase]: 2/56 cut-off events.
[2024-11-28 02:29:25,788 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-28 02:29:25,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 56 events. 2/56 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 178 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place.
[2024-11-28 02:29:25,794 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 58 transitions, 124 flow
[2024-11-28 02:29:25,800 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 56 transitions, 118 flow
[2024-11-28 02:29:25,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-28 02:29:25,840 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;@40f4f041, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-28 02:29:25,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations.
[2024-11-28 02:29:25,852 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-28 02:29:25,852 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-11-28 02:29:25,852 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-28 02:29:25,852 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-28 02:29:25,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-28 02:29:25,853 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] ===
[2024-11-28 02:29:25,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 02:29:25,860 INFO L85 PathProgramCache]: Analyzing trace with hash 17807056, now seen corresponding path program 1 times
[2024-11-28 02:29:25,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-28 02:29:25,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553064890]
[2024-11-28 02:29:25,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 02:29:25,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-28 02:29:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 02:29:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-28 02:29:26,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-28 02:29:26,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553064890]
[2024-11-28 02:29:26,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553064890] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 02:29:26,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 02:29:26,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-28 02:29:26,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678274596]
[2024-11-28 02:29:26,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 02:29:26,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-28 02:29:26,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-28 02:29:26,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-28 02:29:26,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-28 02:29:26,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58
[2024-11-28 02:29:26,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:26,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-28 02:29:26,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58
[2024-11-28 02:29:26,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-28 02:29:26,986 INFO L124 PetriNetUnfolderBase]: 564/1097 cut-off events.
[2024-11-28 02:29:26,986 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-28 02:29:26,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2048 conditions, 1097 events. 564/1097 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7399 event pairs, 564 based on Foata normal form. 56/772 useless extension candidates. Maximal degree in co-relation 2038. Up to 937 conditions per place.
[2024-11-28 02:29:27,004 INFO L140 encePairwiseOnDemand]: 39/58 looper letters, 24 selfloop transitions, 1 changer transitions 0/37 dead transitions.
[2024-11-28 02:29:27,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 130 flow
[2024-11-28 02:29:27,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-28 02:29:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-28 02:29:27,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions.
[2024-11-28 02:29:27,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4885057471264368
[2024-11-28 02:29:27,027 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 118 flow. Second operand 3 states and 85 transitions.
[2024-11-28 02:29:27,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 130 flow
[2024-11-28 02:29:27,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 37 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-28 02:29:27,038 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 80 flow
[2024-11-28 02:29:27,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=37}
[2024-11-28 02:29:27,045 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -17 predicate places.
[2024-11-28 02:29:27,045 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 80 flow
[2024-11-28 02:29:27,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:27,046 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-28 02:29:27,046 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-28 02:29:27,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-28 02:29:27,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] ===
[2024-11-28 02:29:27,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 02:29:27,049 INFO L85 PathProgramCache]: Analyzing trace with hash 17807057, now seen corresponding path program 1 times
[2024-11-28 02:29:27,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-28 02:29:27,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441086363]
[2024-11-28 02:29:27,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 02:29:27,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-28 02:29:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 02:29:27,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-28 02:29:27,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-28 02:29:27,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441086363]
[2024-11-28 02:29:27,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441086363] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 02:29:27,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 02:29:27,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-28 02:29:27,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093228447]
[2024-11-28 02:29:27,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 02:29:27,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-28 02:29:27,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-28 02:29:27,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-28 02:29:27,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-28 02:29:27,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58
[2024-11-28 02:29:27,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:27,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-28 02:29:27,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58
[2024-11-28 02:29:27,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-28 02:29:27,523 INFO L124 PetriNetUnfolderBase]: 180/395 cut-off events.
[2024-11-28 02:29:27,523 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-28 02:29:27,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 395 events. 180/395 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2296 event pairs, 180 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 720. Up to 319 conditions per place.
[2024-11-28 02:29:27,530 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 17 selfloop transitions, 1 changer transitions 1/31 dead transitions.
[2024-11-28 02:29:27,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 106 flow
[2024-11-28 02:29:27,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-28 02:29:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-28 02:29:27,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions.
[2024-11-28 02:29:27,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3850574712643678
[2024-11-28 02:29:27,532 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 80 flow. Second operand 3 states and 67 transitions.
[2024-11-28 02:29:27,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 106 flow
[2024-11-28 02:29:27,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 105 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-28 02:29:27,533 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 67 flow
[2024-11-28 02:29:27,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=39, PETRI_TRANSITIONS=30}
[2024-11-28 02:29:27,534 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -22 predicate places.
[2024-11-28 02:29:27,534 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 67 flow
[2024-11-28 02:29:27,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:27,534 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-28 02:29:27,534 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 02:29:27,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-28 02:29:27,537 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] ===
[2024-11-28 02:29:27,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 02:29:27,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1974856797, now seen corresponding path program 1 times
[2024-11-28 02:29:27,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-28 02:29:27,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595501529]
[2024-11-28 02:29:27,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 02:29:27,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-28 02:29:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 02:29:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-28 02:29:27,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-28 02:29:27,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595501529]
[2024-11-28 02:29:27,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595501529] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 02:29:27,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 02:29:27,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-28 02:29:27,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381229729]
[2024-11-28 02:29:27,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 02:29:27,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-28 02:29:27,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-28 02:29:27,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-28 02:29:27,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-28 02:29:27,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58
[2024-11-28 02:29:27,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:27,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-28 02:29:27,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58
[2024-11-28 02:29:27,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-28 02:29:27,937 INFO L124 PetriNetUnfolderBase]: 149/339 cut-off events.
[2024-11-28 02:29:27,937 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-28 02:29:27,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 339 events. 149/339 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1799 event pairs, 65 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 613. Up to 213 conditions per place.
[2024-11-28 02:29:27,940 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 28 selfloop transitions, 2 changer transitions 0/42 dead transitions.
[2024-11-28 02:29:27,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 153 flow
[2024-11-28 02:29:27,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-28 02:29:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-28 02:29:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions.
[2024-11-28 02:29:27,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42528735632183906
[2024-11-28 02:29:27,942 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 67 flow. Second operand 3 states and 74 transitions.
[2024-11-28 02:29:27,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 153 flow
[2024-11-28 02:29:27,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 152 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-28 02:29:27,945 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 76 flow
[2024-11-28 02:29:27,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=40, PETRI_TRANSITIONS=30}
[2024-11-28 02:29:27,946 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -21 predicate places.
[2024-11-28 02:29:27,946 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 76 flow
[2024-11-28 02:29:27,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:27,948 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-28 02:29:27,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 02:29:27,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-28 02:29:27,948 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] ===
[2024-11-28 02:29:27,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 02:29:27,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1196960998, now seen corresponding path program 1 times
[2024-11-28 02:29:27,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-28 02:29:27,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352402623]
[2024-11-28 02:29:27,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 02:29:27,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-28 02:29:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 02:29:28,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-28 02:29:28,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-28 02:29:28,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352402623]
[2024-11-28 02:29:28,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352402623] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 02:29:28,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 02:29:28,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-28 02:29:28,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507386024]
[2024-11-28 02:29:28,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 02:29:28,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-28 02:29:28,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-28 02:29:28,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-28 02:29:28,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-28 02:29:28,163 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58
[2024-11-28 02:29:28,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:28,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-28 02:29:28,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58
[2024-11-28 02:29:28,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-28 02:29:28,387 INFO L124 PetriNetUnfolderBase]: 139/377 cut-off events.
[2024-11-28 02:29:28,388 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES.
[2024-11-28 02:29:28,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 377 events. 139/377 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2080 event pairs, 25 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 709. Up to 194 conditions per place.
[2024-11-28 02:29:28,392 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 27 selfloop transitions, 2 changer transitions 0/41 dead transitions.
[2024-11-28 02:29:28,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 156 flow
[2024-11-28 02:29:28,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-28 02:29:28,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-28 02:29:28,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions.
[2024-11-28 02:29:28,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3706896551724138
[2024-11-28 02:29:28,394 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 76 flow. Second operand 4 states and 86 transitions.
[2024-11-28 02:29:28,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 156 flow
[2024-11-28 02:29:28,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-28 02:29:28,396 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 72 flow
[2024-11-28 02:29:28,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=29}
[2024-11-28 02:29:28,396 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -21 predicate places.
[2024-11-28 02:29:28,399 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 72 flow
[2024-11-28 02:29:28,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:28,399 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-28 02:29:28,399 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 02:29:28,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-28 02:29:28,400 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] ===
[2024-11-28 02:29:28,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 02:29:28,400 INFO L85 PathProgramCache]: Analyzing trace with hash 538188983, now seen corresponding path program 1 times
[2024-11-28 02:29:28,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-28 02:29:28,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009738310]
[2024-11-28 02:29:28,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 02:29:28,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-28 02:29:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 02:29:28,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-28 02:29:28,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-28 02:29:28,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009738310]
[2024-11-28 02:29:28,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009738310] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 02:29:28,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 02:29:28,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-28 02:29:28,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575047044]
[2024-11-28 02:29:28,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 02:29:28,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-28 02:29:28,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-28 02:29:28,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-28 02:29:28,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-28 02:29:28,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58
[2024-11-28 02:29:28,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:28,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-28 02:29:28,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58
[2024-11-28 02:29:28,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-28 02:29:29,072 INFO L124 PetriNetUnfolderBase]: 129/359 cut-off events.
[2024-11-28 02:29:29,072 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES.
[2024-11-28 02:29:29,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 359 events. 129/359 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1953 event pairs, 21 based on Foata normal form. 8/364 useless extension candidates. Maximal degree in co-relation 665. Up to 176 conditions per place.
[2024-11-28 02:29:29,075 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 26 selfloop transitions, 2 changer transitions 0/40 dead transitions.
[2024-11-28 02:29:29,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 150 flow
[2024-11-28 02:29:29,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-28 02:29:29,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-28 02:29:29,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions.
[2024-11-28 02:29:29,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36637931034482757
[2024-11-28 02:29:29,077 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 72 flow. Second operand 4 states and 85 transitions.
[2024-11-28 02:29:29,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 150 flow
[2024-11-28 02:29:29,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 145 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-28 02:29:29,078 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 67 flow
[2024-11-28 02:29:29,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=67, PETRI_PLACES=39, PETRI_TRANSITIONS=28}
[2024-11-28 02:29:29,079 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -22 predicate places.
[2024-11-28 02:29:29,079 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 67 flow
[2024-11-28 02:29:29,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:29,079 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-28 02:29:29,080 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 02:29:29,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-28 02:29:29,080 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] ===
[2024-11-28 02:29:29,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 02:29:29,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1796460990, now seen corresponding path program 1 times
[2024-11-28 02:29:29,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-28 02:29:29,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323547193]
[2024-11-28 02:29:29,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 02:29:29,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-28 02:29:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 02:29:29,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-28 02:29:29,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-28 02:29:29,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323547193]
[2024-11-28 02:29:29,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323547193] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 02:29:29,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 02:29:29,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-28 02:29:29,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444990521]
[2024-11-28 02:29:29,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 02:29:29,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-28 02:29:29,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-28 02:29:29,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-28 02:29:29,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-28 02:29:29,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 58
[2024-11-28 02:29:29,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:29,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-28 02:29:29,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 58
[2024-11-28 02:29:29,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-28 02:29:29,253 INFO L124 PetriNetUnfolderBase]: 129/296 cut-off events.
[2024-11-28 02:29:29,253 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES.
[2024-11-28 02:29:29,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 296 events. 129/296 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1563 event pairs, 129 based on Foata normal form. 12/298 useless extension candidates. Maximal degree in co-relation 602. Up to 232 conditions per place.
[2024-11-28 02:29:29,255 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 14 selfloop transitions, 1 changer transitions 1/27 dead transitions.
[2024-11-28 02:29:29,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 27 transitions, 97 flow
[2024-11-28 02:29:29,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-28 02:29:29,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-28 02:29:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions.
[2024-11-28 02:29:29,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3218390804597701
[2024-11-28 02:29:29,257 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 67 flow. Second operand 3 states and 56 transitions.
[2024-11-28 02:29:29,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 27 transitions, 97 flow
[2024-11-28 02:29:29,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 27 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-28 02:29:29,258 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 62 flow
[2024-11-28 02:29:29,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=38, PETRI_TRANSITIONS=26}
[2024-11-28 02:29:29,259 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -23 predicate places.
[2024-11-28 02:29:29,259 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 62 flow
[2024-11-28 02:29:29,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:29,260 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-28 02:29:29,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 02:29:29,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-28 02:29:29,260 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] ===
[2024-11-28 02:29:29,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 02:29:29,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1796460333, now seen corresponding path program 1 times
[2024-11-28 02:29:29,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-28 02:29:29,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462897306]
[2024-11-28 02:29:29,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 02:29:29,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-28 02:29:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 02:29:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-28 02:29:29,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-28 02:29:29,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462897306]
[2024-11-28 02:29:29,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462897306] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 02:29:29,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 02:29:29,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-28 02:29:29,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990009494]
[2024-11-28 02:29:29,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 02:29:29,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-28 02:29:29,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-28 02:29:29,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-28 02:29:29,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-28 02:29:29,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 58
[2024-11-28 02:29:29,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:29,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-28 02:29:29,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 58
[2024-11-28 02:29:29,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-28 02:29:29,725 INFO L124 PetriNetUnfolderBase]: 180/382 cut-off events.
[2024-11-28 02:29:29,725 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-28 02:29:29,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 382 events. 180/382 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1786 event pairs, 24 based on Foata normal form. 20/395 useless extension candidates. Maximal degree in co-relation 781. Up to 199 conditions per place.
[2024-11-28 02:29:29,728 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 29 selfloop transitions, 4 changer transitions 1/42 dead transitions.
[2024-11-28 02:29:29,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 168 flow
[2024-11-28 02:29:29,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-28 02:29:29,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-28 02:29:29,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions.
[2024-11-28 02:29:29,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3448275862068966
[2024-11-28 02:29:29,729 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 62 flow. Second operand 4 states and 80 transitions.
[2024-11-28 02:29:29,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 168 flow
[2024-11-28 02:29:29,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-28 02:29:29,731 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 87 flow
[2024-11-28 02:29:29,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=41, PETRI_TRANSITIONS=28}
[2024-11-28 02:29:29,731 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -20 predicate places.
[2024-11-28 02:29:29,731 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 87 flow
[2024-11-28 02:29:29,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:29,732 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-28 02:29:29,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 02:29:29,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-28 02:29:29,732 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] ===
[2024-11-28 02:29:29,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 02:29:29,733 INFO L85 PathProgramCache]: Analyzing trace with hash -77233925, now seen corresponding path program 1 times
[2024-11-28 02:29:29,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-28 02:29:29,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965656903]
[2024-11-28 02:29:29,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 02:29:29,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-28 02:29:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 02:29:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-28 02:29:30,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-28 02:29:30,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965656903]
[2024-11-28 02:29:30,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965656903] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 02:29:30,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 02:29:30,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-28 02:29:30,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46368316]
[2024-11-28 02:29:30,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 02:29:30,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-28 02:29:30,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-28 02:29:30,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-28 02:29:30,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-28 02:29:30,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 58
[2024-11-28 02:29:30,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:30,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-28 02:29:30,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 58
[2024-11-28 02:29:30,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-28 02:29:30,249 INFO L124 PetriNetUnfolderBase]: 88/194 cut-off events.
[2024-11-28 02:29:30,249 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES.
[2024-11-28 02:29:30,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 194 events. 88/194 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 619 event pairs, 16 based on Foata normal form. 14/203 useless extension candidates. Maximal degree in co-relation 477. Up to 71 conditions per place.
[2024-11-28 02:29:30,251 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 25 selfloop transitions, 6 changer transitions 1/40 dead transitions.
[2024-11-28 02:29:30,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 182 flow
[2024-11-28 02:29:30,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-28 02:29:30,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-28 02:29:30,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions.
[2024-11-28 02:29:30,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30689655172413793
[2024-11-28 02:29:30,253 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 87 flow. Second operand 5 states and 89 transitions.
[2024-11-28 02:29:30,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 182 flow
[2024-11-28 02:29:30,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 173 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-11-28 02:29:30,255 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 103 flow
[2024-11-28 02:29:30,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=45, PETRI_TRANSITIONS=28}
[2024-11-28 02:29:30,255 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -16 predicate places.
[2024-11-28 02:29:30,256 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 103 flow
[2024-11-28 02:29:30,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:30,256 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-28 02:29:30,256 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 02:29:30,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-28 02:29:30,256 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] ===
[2024-11-28 02:29:30,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 02:29:30,257 INFO L85 PathProgramCache]: Analyzing trace with hash 139229745, now seen corresponding path program 1 times
[2024-11-28 02:29:30,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-28 02:29:30,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700607272]
[2024-11-28 02:29:30,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 02:29:30,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-28 02:29:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 02:29:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-28 02:29:30,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-28 02:29:30,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700607272]
[2024-11-28 02:29:30,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700607272] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 02:29:30,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 02:29:30,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-28 02:29:30,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487669977]
[2024-11-28 02:29:30,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 02:29:30,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-28 02:29:30,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-28 02:29:30,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-28 02:29:30,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-28 02:29:30,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 58
[2024-11-28 02:29:30,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 103 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:30,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-28 02:29:30,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 58
[2024-11-28 02:29:30,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-28 02:29:30,986 INFO L124 PetriNetUnfolderBase]: 105/266 cut-off events.
[2024-11-28 02:29:30,987 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES.
[2024-11-28 02:29:30,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 266 events. 105/266 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1074 event pairs, 39 based on Foata normal form. 4/261 useless extension candidates. Maximal degree in co-relation 616. Up to 76 conditions per place.
[2024-11-28 02:29:30,988 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 19 selfloop transitions, 3 changer transitions 15/48 dead transitions.
[2024-11-28 02:29:30,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 48 transitions, 225 flow
[2024-11-28 02:29:30,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-28 02:29:30,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-28 02:29:30,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions.
[2024-11-28 02:29:30,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3160919540229885
[2024-11-28 02:29:30,990 INFO L175 Difference]: Start difference. First operand has 45 places, 28 transitions, 103 flow. Second operand 6 states and 110 transitions.
[2024-11-28 02:29:30,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 48 transitions, 225 flow
[2024-11-28 02:29:30,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 191 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-11-28 02:29:30,993 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 89 flow
[2024-11-28 02:29:30,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=89, PETRI_PLACES=47, PETRI_TRANSITIONS=28}
[2024-11-28 02:29:30,994 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -14 predicate places.
[2024-11-28 02:29:30,994 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 89 flow
[2024-11-28 02:29:30,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:30,995 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-28 02:29:30,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 02:29:30,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-28 02:29:30,995 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] ===
[2024-11-28 02:29:30,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 02:29:30,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1980367481, now seen corresponding path program 2 times
[2024-11-28 02:29:30,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-28 02:29:30,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949655540]
[2024-11-28 02:29:30,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-28 02:29:30,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-28 02:29:31,090 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-28 02:29:31,090 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-28 02:29:31,090 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-28 02:29:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-28 02:29:31,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-28 02:29:31,246 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-11-28 02:29:31,247 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (45 of 46 remaining)
[2024-11-28 02:29:31,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 46 remaining)
[2024-11-28 02:29:31,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 46 remaining)
[2024-11-28 02:29:31,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 46 remaining)
[2024-11-28 02:29:31,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 46 remaining)
[2024-11-28 02:29:31,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 46 remaining)
[2024-11-28 02:29:31,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 46 remaining)
[2024-11-28 02:29:31,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 46 remaining)
[2024-11-28 02:29:31,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 46 remaining)
[2024-11-28 02:29:31,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 46 remaining)
[2024-11-28 02:29:31,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 46 remaining)
[2024-11-28 02:29:31,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 46 remaining)
[2024-11-28 02:29:31,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 46 remaining)
[2024-11-28 02:29:31,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 46 remaining)
[2024-11-28 02:29:31,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 46 remaining)
[2024-11-28 02:29:31,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 46 remaining)
[2024-11-28 02:29:31,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 46 remaining)
[2024-11-28 02:29:31,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 46 remaining)
[2024-11-28 02:29:31,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 46 remaining)
[2024-11-28 02:29:31,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 46 remaining)
[2024-11-28 02:29:31,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 46 remaining)
[2024-11-28 02:29:31,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 46 remaining)
[2024-11-28 02:29:31,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 46 remaining)
[2024-11-28 02:29:31,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 46 remaining)
[2024-11-28 02:29:31,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 46 remaining)
[2024-11-28 02:29:31,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (20 of 46 remaining)
[2024-11-28 02:29:31,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 46 remaining)
[2024-11-28 02:29:31,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 46 remaining)
[2024-11-28 02:29:31,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 46 remaining)
[2024-11-28 02:29:31,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 46 remaining)
[2024-11-28 02:29:31,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 46 remaining)
[2024-11-28 02:29:31,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 46 remaining)
[2024-11-28 02:29:31,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 46 remaining)
[2024-11-28 02:29:31,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 46 remaining)
[2024-11-28 02:29:31,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 46 remaining)
[2024-11-28 02:29:31,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 46 remaining)
[2024-11-28 02:29:31,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 46 remaining)
[2024-11-28 02:29:31,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 46 remaining)
[2024-11-28 02:29:31,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 46 remaining)
[2024-11-28 02:29:31,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 46 remaining)
[2024-11-28 02:29:31,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 46 remaining)
[2024-11-28 02:29:31,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 46 remaining)
[2024-11-28 02:29:31,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 46 remaining)
[2024-11-28 02:29:31,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 46 remaining)
[2024-11-28 02:29:31,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 46 remaining)
[2024-11-28 02:29:31,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 46 remaining)
[2024-11-28 02:29:31,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-28 02:29:31,255 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 02:29:31,378 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-28 02:29:31,378 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-28 02:29:31,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:29:31 BasicIcfg
[2024-11-28 02:29:31,388 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-28 02:29:31,389 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-28 02:29:31,389 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-28 02:29:31,389 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-28 02:29:31,390 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:29:25" (3/4) ...
[2024-11-28 02:29:31,392 INFO L149 WitnessPrinter]: No result that supports witness generation found
[2024-11-28 02:29:31,393 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-28 02:29:31,395 INFO L158 Benchmark]: Toolchain (without parser) took 8413.91ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 93.0MB in the beginning and 131.0MB in the end (delta: -38.0MB). Peak memory consumption was 196.5MB. Max. memory is 16.1GB.
[2024-11-28 02:29:31,397 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 104.3MB in the end (delta: 216.0kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-28 02:29:31,397 INFO L158 Benchmark]: CACSL2BoogieTranslator took 702.25ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 70.3MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-28 02:29:31,398 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.00ms. Allocated memory is still 117.4MB. Free memory was 70.3MB in the beginning and 68.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-28 02:29:31,399 INFO L158 Benchmark]: Boogie Preprocessor took 82.60ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 65.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-28 02:29:31,400 INFO L158 Benchmark]: RCFGBuilder took 1624.36ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 65.2MB in the beginning and 304.0MB in the end (delta: -238.8MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB.
[2024-11-28 02:29:31,400 INFO L158 Benchmark]: TraceAbstraction took 5947.73ms. Allocated memory is still 352.3MB. Free memory was 303.3MB in the beginning and 134.7MB in the end (delta: 168.7MB). Peak memory consumption was 163.6MB. Max. memory is 16.1GB.
[2024-11-28 02:29:31,401 INFO L158 Benchmark]: Witness Printer took 4.09ms. Allocated memory is still 352.3MB. Free memory was 134.7MB in the beginning and 131.0MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-28 02:29:31,404 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.55ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 104.3MB in the end (delta: 216.0kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 702.25ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 70.3MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 42.00ms. Allocated memory is still 117.4MB. Free memory was 70.3MB in the beginning and 68.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 82.60ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 65.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 1624.36ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 65.2MB in the beginning and 304.0MB in the end (delta: -238.8MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB.
* TraceAbstraction took 5947.73ms. Allocated memory is still 352.3MB. Free memory was 303.3MB in the beginning and 134.7MB in the end (delta: 168.7MB). Peak memory consumption was 163.6MB. Max. memory is 16.1GB.
* Witness Printer took 4.09ms. Allocated memory is still 352.3MB. Free memory was 134.7MB in the beginning and 131.0MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 18.
Possible FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p0_EAX = 0;
[L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed;
[L713] 0 int __unbuffered_p0_EAX$mem_tmp;
[L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0;
[L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1;
[L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2;
[L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0;
[L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1;
[L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2;
[L720] 0 _Bool __unbuffered_p0_EAX$read_delayed;
[L721] 0 int *__unbuffered_p0_EAX$read_delayed_var;
[L722] 0 int __unbuffered_p0_EAX$w_buff0;
[L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used;
[L724] 0 int __unbuffered_p0_EAX$w_buff1;
[L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used;
[L727] 0 int __unbuffered_p1_EAX = 0;
[L728] 0 _Bool main$tmp_guard0;
[L729] 0 _Bool main$tmp_guard1;
[L731] 0 int x = 0;
[L733] 0 int y = 0;
[L733] 0 int y = 0;
[L734] 0 _Bool y$flush_delayed;
[L735] 0 int y$mem_tmp;
[L736] 0 _Bool y$r_buff0_thd0;
[L737] 0 _Bool y$r_buff0_thd1;
[L738] 0 _Bool y$r_buff0_thd2;
[L739] 0 _Bool y$r_buff1_thd0;
[L740] 0 _Bool y$r_buff1_thd1;
[L741] 0 _Bool y$r_buff1_thd2;
[L742] 0 _Bool y$read_delayed;
[L743] 0 int *y$read_delayed_var;
[L744] 0 int y$w_buff0;
[L745] 0 _Bool y$w_buff0_used;
[L746] 0 int y$w_buff1;
[L747] 0 _Bool y$w_buff1_used;
[L748] 0 _Bool weak$$choice0;
[L749] 0 _Bool weak$$choice1;
[L750] 0 _Bool weak$$choice2;
[L812] 0 pthread_t t1929;
[L813] FCALL, FORK 0 pthread_create(&t1929, ((void *)0), P0, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1929=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L754] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L755] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L756] 1 y$flush_delayed = weak$$choice2
[L757] EXPR 1 \read(y)
[L757] 1 y$mem_tmp = y
[L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L758] EXPR 1 \read(y)
[L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L765] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1
[L766] 1 __unbuffered_p0_EAX$read_delayed_var = &y
[L767] EXPR 1 \read(y)
[L767] 1 __unbuffered_p0_EAX = y
[L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y
[L768] EXPR 1 \read(y)
[L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y
[L768] 1 y = y$flush_delayed ? y$mem_tmp : y
[L769] 1 y$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L814] 0 pthread_t t1930;
[L815] FCALL, FORK 0 pthread_create(&t1930, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1929=-2, t1930=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L772] 1 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L784] 2 __unbuffered_p1_EAX = x
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L787] 2 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L790] EXPR 2 \read(y)
[L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929=-2, t1930=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L819] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L4] COND FALSE 0 !(!cond)
[L819] RET 0 assume_abort_if_not(main$tmp_guard0)
[L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L821] EXPR 0 \read(y)
[L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929=-2, t1930=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L828] 0 weak$$choice1 = __VERIFIER_nondet_bool()
[L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L829] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var)
[L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L829] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L830] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929=-2, t1930=-1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L832] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L19] COND TRUE 0 !expression
[L19] CALL 0 reach_error()
[L18] COND FALSE 0 !(0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L18] 0 __assert_fail ("0", "safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: 810]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 815]: 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: 813]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 5 procedures, 91 locations, 46 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 200 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 184 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 389 IncrementalHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 6 mSDtfsCounter, 389 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=0, InterpolantAutomatonStates: 35, 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.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-11-28 02:29:31,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB --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 15ac4e1d4eb7f123e42f66ffca6b608a72882a0faec253c9cc2d868c4bb280c3
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-d790fec
[2024-11-28 02:29:34,400 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-28 02:29:34,514 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2024-11-28 02:29:34,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-28 02:29:34,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-28 02:29:34,606 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-28 02:29:34,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-28 02:29:34,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-28 02:29:34,611 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-28 02:29:34,611 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-28 02:29:34,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-28 02:29:34,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-28 02:29:34,612 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-28 02:29:34,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-28 02:29:34,612 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-28 02:29:34,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-28 02:29:34,612 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-28 02:29:34,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-28 02:29:34,618 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-28 02:29:34,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-28 02:29:34,618 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-28 02:29:34,618 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-28 02:29:34,618 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-28 02:29:34,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-28 02:29:34,618 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-28 02:29:34,619 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-28 02:29:34,619 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-28 02:29:34,619 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-28 02:29:34,619 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-28 02:29:34,619 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-28 02:29:34,619 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-28 02:29:34,619 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-28 02:29:34,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-28 02:29:34,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-28 02:29:34,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-28 02:29:34,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-28 02:29:34,620 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-28 02:29:34,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-28 02:29:34,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-28 02:29:34,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-28 02:29:34,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-28 02:29:34,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-28 02:29:34,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-28 02:29:34,620 INFO L153 SettingsManager]: * Trace refinement strategy=FOX
[2024-11-28 02:29:34,621 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-28 02:29:34,621 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-28 02:29:34,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-28 02:29:34,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-28 02:29:34,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-28 02:29:34,621 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB
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 -> 15ac4e1d4eb7f123e42f66ffca6b608a72882a0faec253c9cc2d868c4bb280c3
[2024-11-28 02:29:34,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-28 02:29:34,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-28 02:29:34,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-28 02:29:34,984 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-28 02:29:34,985 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-28 02:29:34,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i
[2024-11-28 02:29:38,024 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/data/7729eb924/80b6e18ac95d4f43b3aeca89177e3125/FLAG4e80b172f
[2024-11-28 02:29:38,334 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-28 02:29:38,335 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i
[2024-11-28 02:29:38,352 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/data/7729eb924/80b6e18ac95d4f43b3aeca89177e3125/FLAG4e80b172f
[2024-11-28 02:29:38,366 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/data/7729eb924/80b6e18ac95d4f43b3aeca89177e3125
[2024-11-28 02:29:38,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-28 02:29:38,371 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-28 02:29:38,372 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-28 02:29:38,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-28 02:29:38,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-28 02:29:38,378 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:29:38" (1/1) ...
[2024-11-28 02:29:38,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3004f26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:38, skipping insertion in model container
[2024-11-28 02:29:38,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:29:38" (1/1) ...
[2024-11-28 02:29:38,416 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-28 02:29:38,773 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-28 02:29:38,790 INFO L200 MainTranslator]: Completed pre-run
[2024-11-28 02:29:38,852 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-28 02:29:38,897 INFO L204 MainTranslator]: Completed translation
[2024-11-28 02:29:38,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:38 WrapperNode
[2024-11-28 02:29:38,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-28 02:29:38,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-28 02:29:38,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-28 02:29:38,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-28 02:29:38,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:38" (1/1) ...
[2024-11-28 02:29:38,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:38" (1/1) ...
[2024-11-28 02:29:38,960 INFO L138 Inliner]: procedures = 178, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116
[2024-11-28 02:29:38,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-28 02:29:38,961 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-28 02:29:38,961 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-28 02:29:38,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-28 02:29:38,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:38" (1/1) ...
[2024-11-28 02:29:38,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:38" (1/1) ...
[2024-11-28 02:29:38,976 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:38" (1/1) ...
[2024-11-28 02:29:38,999 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5].
[2024-11-28 02:29:38,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:38" (1/1) ...
[2024-11-28 02:29:38,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:38" (1/1) ...
[2024-11-28 02:29:39,009 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:38" (1/1) ...
[2024-11-28 02:29:39,010 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:38" (1/1) ...
[2024-11-28 02:29:39,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:38" (1/1) ...
[2024-11-28 02:29:39,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:38" (1/1) ...
[2024-11-28 02:29:39,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:38" (1/1) ...
[2024-11-28 02:29:39,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-28 02:29:39,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-28 02:29:39,021 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-28 02:29:39,021 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-28 02:29:39,022 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:38" (1/1) ...
[2024-11-28 02:29:39,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-28 02:29:39,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 02:29:39,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-28 02:29:39,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-28 02:29:39,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0
[2024-11-28 02:29:39,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1
[2024-11-28 02:29:39,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-28 02:29:39,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-28 02:29:39,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0
[2024-11-28 02:29:39,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1
[2024-11-28 02:29:39,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-28 02:29:39,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2024-11-28 02:29:39,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0
[2024-11-28 02:29:39,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1
[2024-11-28 02:29:39,080 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-28 02:29:39,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-28 02:29:39,081 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-28 02:29:39,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-28 02:29:39,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-28 02:29:39,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-28 02:29:39,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-28 02:29:39,083 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-28 02:29:39,251 INFO L234 CfgBuilder]: Building ICFG
[2024-11-28 02:29:39,254 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-28 02:29:39,909 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-28 02:29:39,909 INFO L283 CfgBuilder]: Performing block encoding
[2024-11-28 02:29:40,645 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-28 02:29:40,645 INFO L312 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-28 02:29:40,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:29:40 BoogieIcfgContainer
[2024-11-28 02:29:40,646 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-28 02:29:40,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-28 02:29:40,650 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-28 02:29:40,656 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-28 02:29:40,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:29:38" (1/3) ...
[2024-11-28 02:29:40,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420d6e1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:29:40, skipping insertion in model container
[2024-11-28 02:29:40,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:29:38" (2/3) ...
[2024-11-28 02:29:40,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420d6e1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:29:40, skipping insertion in model container
[2024-11-28 02:29:40,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:29:40" (3/3) ...
[2024-11-28 02:29:40,661 INFO L128 eAbstractionObserver]: Analyzing ICFG safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i
[2024-11-28 02:29:40,679 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-28 02:29:40,680 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i that has 3 procedures, 57 locations, 1 initial locations, 0 loop locations, and 26 error locations.
[2024-11-28 02:29:40,681 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-28 02:29:40,862 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-28 02:29:40,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 58 transitions, 124 flow
[2024-11-28 02:29:40,985 INFO L124 PetriNetUnfolderBase]: 2/56 cut-off events.
[2024-11-28 02:29:40,990 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-28 02:29:40,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 56 events. 2/56 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 178 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place.
[2024-11-28 02:29:40,996 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 58 transitions, 124 flow
[2024-11-28 02:29:41,001 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 56 transitions, 118 flow
[2024-11-28 02:29:41,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-28 02:29:41,031 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;@7a303887, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-28 02:29:41,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations.
[2024-11-28 02:29:41,039 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-28 02:29:41,039 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-11-28 02:29:41,040 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-28 02:29:41,040 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-28 02:29:41,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-28 02:29:41,041 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] ===
[2024-11-28 02:29:41,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 02:29:41,050 INFO L85 PathProgramCache]: Analyzing trace with hash 17868624, now seen corresponding path program 1 times
[2024-11-28 02:29:41,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 02:29:41,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1794457295]
[2024-11-28 02:29:41,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 02:29:41,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 02:29:41,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 02:29:41,070 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 02:29:41,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-28 02:29:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 02:29:41,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-28 02:29:41,285 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 02:29:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-28 02:29:41,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-28 02:29:41,376 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 02:29:41,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794457295]
[2024-11-28 02:29:41,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794457295] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 02:29:41,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 02:29:41,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-28 02:29:41,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122058042]
[2024-11-28 02:29:41,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 02:29:41,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-28 02:29:41,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 02:29:41,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-28 02:29:41,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-28 02:29:41,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58
[2024-11-28 02:29:41,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:41,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-28 02:29:41,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58
[2024-11-28 02:29:41,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-28 02:29:42,100 INFO L124 PetriNetUnfolderBase]: 564/1097 cut-off events.
[2024-11-28 02:29:42,100 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-28 02:29:42,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2048 conditions, 1097 events. 564/1097 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7399 event pairs, 564 based on Foata normal form. 56/772 useless extension candidates. Maximal degree in co-relation 2038. Up to 937 conditions per place.
[2024-11-28 02:29:42,112 INFO L140 encePairwiseOnDemand]: 39/58 looper letters, 24 selfloop transitions, 1 changer transitions 0/37 dead transitions.
[2024-11-28 02:29:42,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 130 flow
[2024-11-28 02:29:42,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-28 02:29:42,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-28 02:29:42,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions.
[2024-11-28 02:29:42,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4885057471264368
[2024-11-28 02:29:42,128 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 118 flow. Second operand 3 states and 85 transitions.
[2024-11-28 02:29:42,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 130 flow
[2024-11-28 02:29:42,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 37 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-28 02:29:42,136 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 80 flow
[2024-11-28 02:29:42,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=37}
[2024-11-28 02:29:42,145 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -17 predicate places.
[2024-11-28 02:29:42,146 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 80 flow
[2024-11-28 02:29:42,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:42,146 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-28 02:29:42,146 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-28 02:29:42,157 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-28 02:29:42,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 02:29:42,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] ===
[2024-11-28 02:29:42,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 02:29:42,348 INFO L85 PathProgramCache]: Analyzing trace with hash 17868625, now seen corresponding path program 1 times
[2024-11-28 02:29:42,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 02:29:42,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1128036541]
[2024-11-28 02:29:42,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 02:29:42,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 02:29:42,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 02:29:42,352 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 02:29:42,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-28 02:29:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 02:29:42,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-28 02:29:42,486 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 02:29:42,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-28 02:29:42,552 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-28 02:29:42,553 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 02:29:42,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128036541]
[2024-11-28 02:29:42,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128036541] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 02:29:42,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 02:29:42,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-28 02:29:42,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266321490]
[2024-11-28 02:29:42,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 02:29:42,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-28 02:29:42,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 02:29:42,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-28 02:29:42,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-28 02:29:42,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58
[2024-11-28 02:29:42,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:42,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-28 02:29:42,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58
[2024-11-28 02:29:42,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-28 02:29:42,736 INFO L124 PetriNetUnfolderBase]: 180/395 cut-off events.
[2024-11-28 02:29:42,736 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-28 02:29:42,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 395 events. 180/395 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2296 event pairs, 180 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 720. Up to 319 conditions per place.
[2024-11-28 02:29:42,740 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 17 selfloop transitions, 1 changer transitions 1/31 dead transitions.
[2024-11-28 02:29:42,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 106 flow
[2024-11-28 02:29:42,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-28 02:29:42,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-28 02:29:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions.
[2024-11-28 02:29:42,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3850574712643678
[2024-11-28 02:29:42,742 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 80 flow. Second operand 3 states and 67 transitions.
[2024-11-28 02:29:42,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 106 flow
[2024-11-28 02:29:42,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 105 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-28 02:29:42,744 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 67 flow
[2024-11-28 02:29:42,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=39, PETRI_TRANSITIONS=30}
[2024-11-28 02:29:42,745 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -22 predicate places.
[2024-11-28 02:29:42,745 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 67 flow
[2024-11-28 02:29:42,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:42,745 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-28 02:29:42,745 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 02:29:42,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-11-28 02:29:42,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 02:29:42,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] ===
[2024-11-28 02:29:42,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 02:29:42,952 INFO L85 PathProgramCache]: Analyzing trace with hash -269970779, now seen corresponding path program 1 times
[2024-11-28 02:29:42,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 02:29:42,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1211162267]
[2024-11-28 02:29:42,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 02:29:42,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 02:29:42,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 02:29:42,956 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 02:29:42,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-28 02:29:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 02:29:43,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-28 02:29:43,097 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 02:29:43,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-28 02:29:43,122 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-28 02:29:43,122 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 02:29:43,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211162267]
[2024-11-28 02:29:43,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211162267] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 02:29:43,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 02:29:43,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-28 02:29:43,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286922027]
[2024-11-28 02:29:43,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 02:29:43,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-28 02:29:43,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 02:29:43,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-28 02:29:43,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-28 02:29:43,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58
[2024-11-28 02:29:43,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:43,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-28 02:29:43,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58
[2024-11-28 02:29:43,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-28 02:29:43,302 INFO L124 PetriNetUnfolderBase]: 149/339 cut-off events.
[2024-11-28 02:29:43,302 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-28 02:29:43,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 339 events. 149/339 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1799 event pairs, 65 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 613. Up to 213 conditions per place.
[2024-11-28 02:29:43,305 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 28 selfloop transitions, 2 changer transitions 0/42 dead transitions.
[2024-11-28 02:29:43,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 153 flow
[2024-11-28 02:29:43,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-28 02:29:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-28 02:29:43,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions.
[2024-11-28 02:29:43,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42528735632183906
[2024-11-28 02:29:43,307 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 67 flow. Second operand 3 states and 74 transitions.
[2024-11-28 02:29:43,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 153 flow
[2024-11-28 02:29:43,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 152 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-28 02:29:43,309 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 76 flow
[2024-11-28 02:29:43,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=40, PETRI_TRANSITIONS=30}
[2024-11-28 02:29:43,310 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -21 predicate places.
[2024-11-28 02:29:43,310 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 76 flow
[2024-11-28 02:29:43,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:43,310 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-28 02:29:43,311 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 02:29:43,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-11-28 02:29:43,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 02:29:43,514 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] ===
[2024-11-28 02:29:43,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 02:29:43,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1085082712, now seen corresponding path program 1 times
[2024-11-28 02:29:43,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 02:29:43,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [975037726]
[2024-11-28 02:29:43,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 02:29:43,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 02:29:43,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 02:29:43,520 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 02:29:43,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-28 02:29:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 02:29:43,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-28 02:29:43,684 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 02:29:43,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-28 02:29:43,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-28 02:29:43,818 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 02:29:43,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975037726]
[2024-11-28 02:29:43,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975037726] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 02:29:43,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 02:29:43,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-28 02:29:43,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112226944]
[2024-11-28 02:29:43,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 02:29:43,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-28 02:29:43,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 02:29:43,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-28 02:29:43,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-28 02:29:43,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58
[2024-11-28 02:29:43,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:43,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-28 02:29:43,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58
[2024-11-28 02:29:43,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-28 02:29:44,063 INFO L124 PetriNetUnfolderBase]: 139/377 cut-off events.
[2024-11-28 02:29:44,064 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES.
[2024-11-28 02:29:44,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 377 events. 139/377 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2077 event pairs, 25 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 709. Up to 194 conditions per place.
[2024-11-28 02:29:44,068 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 27 selfloop transitions, 2 changer transitions 0/41 dead transitions.
[2024-11-28 02:29:44,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 156 flow
[2024-11-28 02:29:44,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-28 02:29:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-28 02:29:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions.
[2024-11-28 02:29:44,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3706896551724138
[2024-11-28 02:29:44,072 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 76 flow. Second operand 4 states and 86 transitions.
[2024-11-28 02:29:44,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 156 flow
[2024-11-28 02:29:44,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-28 02:29:44,073 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 72 flow
[2024-11-28 02:29:44,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=29}
[2024-11-28 02:29:44,074 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -21 predicate places.
[2024-11-28 02:29:44,074 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 72 flow
[2024-11-28 02:29:44,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:44,077 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-28 02:29:44,077 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 02:29:44,088 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2024-11-28 02:29:44,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 02:29:44,278 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] ===
[2024-11-28 02:29:44,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 02:29:44,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1743854727, now seen corresponding path program 1 times
[2024-11-28 02:29:44,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 02:29:44,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1215896049]
[2024-11-28 02:29:44,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 02:29:44,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 02:29:44,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 02:29:44,283 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 02:29:44,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-28 02:29:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 02:29:44,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-28 02:29:44,431 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 02:29:44,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-28 02:29:44,595 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-28 02:29:44,595 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 02:29:44,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215896049]
[2024-11-28 02:29:44,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215896049] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 02:29:44,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 02:29:44,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-28 02:29:44,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146183951]
[2024-11-28 02:29:44,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 02:29:44,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-28 02:29:44,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 02:29:44,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-28 02:29:44,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-28 02:29:44,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58
[2024-11-28 02:29:44,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:44,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-28 02:29:44,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58
[2024-11-28 02:29:44,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-28 02:29:44,792 INFO L124 PetriNetUnfolderBase]: 129/303 cut-off events.
[2024-11-28 02:29:44,792 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES.
[2024-11-28 02:29:44,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 303 events. 129/303 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1538 event pairs, 45 based on Foata normal form. 8/300 useless extension candidates. Maximal degree in co-relation 609. Up to 176 conditions per place.
[2024-11-28 02:29:44,795 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 26 selfloop transitions, 2 changer transitions 0/40 dead transitions.
[2024-11-28 02:29:44,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 150 flow
[2024-11-28 02:29:44,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-28 02:29:44,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-28 02:29:44,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions.
[2024-11-28 02:29:44,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36637931034482757
[2024-11-28 02:29:44,797 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 72 flow. Second operand 4 states and 85 transitions.
[2024-11-28 02:29:44,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 150 flow
[2024-11-28 02:29:44,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 145 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-28 02:29:44,799 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 67 flow
[2024-11-28 02:29:44,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=67, PETRI_PLACES=39, PETRI_TRANSITIONS=28}
[2024-11-28 02:29:44,800 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -22 predicate places.
[2024-11-28 02:29:44,800 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 67 flow
[2024-11-28 02:29:44,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:44,800 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-28 02:29:44,800 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 02:29:44,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-11-28 02:29:45,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 02:29:45,005 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] ===
[2024-11-28 02:29:45,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 02:29:45,006 INFO L85 PathProgramCache]: Analyzing trace with hash -814223296, now seen corresponding path program 1 times
[2024-11-28 02:29:45,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 02:29:45,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1623028159]
[2024-11-28 02:29:45,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 02:29:45,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 02:29:45,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 02:29:45,008 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 02:29:45,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-11-28 02:29:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 02:29:45,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-28 02:29:45,128 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 02:29:45,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-28 02:29:45,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-28 02:29:45,159 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 02:29:45,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623028159]
[2024-11-28 02:29:45,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623028159] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 02:29:45,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 02:29:45,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-28 02:29:45,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138232309]
[2024-11-28 02:29:45,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 02:29:45,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-28 02:29:45,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 02:29:45,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-28 02:29:45,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-28 02:29:45,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 58
[2024-11-28 02:29:45,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:45,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-28 02:29:45,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 58
[2024-11-28 02:29:45,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-28 02:29:45,280 INFO L124 PetriNetUnfolderBase]: 129/296 cut-off events.
[2024-11-28 02:29:45,280 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES.
[2024-11-28 02:29:45,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 296 events. 129/296 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1584 event pairs, 129 based on Foata normal form. 12/298 useless extension candidates. Maximal degree in co-relation 602. Up to 232 conditions per place.
[2024-11-28 02:29:45,283 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 14 selfloop transitions, 1 changer transitions 1/27 dead transitions.
[2024-11-28 02:29:45,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 27 transitions, 97 flow
[2024-11-28 02:29:45,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-28 02:29:45,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-28 02:29:45,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions.
[2024-11-28 02:29:45,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3218390804597701
[2024-11-28 02:29:45,284 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 67 flow. Second operand 3 states and 56 transitions.
[2024-11-28 02:29:45,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 27 transitions, 97 flow
[2024-11-28 02:29:45,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 27 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-28 02:29:45,286 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 62 flow
[2024-11-28 02:29:45,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=38, PETRI_TRANSITIONS=26}
[2024-11-28 02:29:45,286 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -23 predicate places.
[2024-11-28 02:29:45,287 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 62 flow
[2024-11-28 02:29:45,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:45,287 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-28 02:29:45,287 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 02:29:45,297 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-11-28 02:29:45,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 02:29:45,488 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] ===
[2024-11-28 02:29:45,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 02:29:45,488 INFO L85 PathProgramCache]: Analyzing trace with hash -814223953, now seen corresponding path program 1 times
[2024-11-28 02:29:45,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 02:29:45,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [811895309]
[2024-11-28 02:29:45,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 02:29:45,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 02:29:45,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 02:29:45,490 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 02:29:45,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-11-28 02:29:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 02:29:45,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-28 02:29:45,604 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 02:29:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-28 02:29:45,638 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-28 02:29:45,638 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 02:29:45,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811895309]
[2024-11-28 02:29:45,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811895309] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 02:29:45,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 02:29:45,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-28 02:29:45,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927646157]
[2024-11-28 02:29:45,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 02:29:45,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-28 02:29:45,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 02:29:45,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-28 02:29:45,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-28 02:29:45,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 58
[2024-11-28 02:29:45,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:45,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-28 02:29:45,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 58
[2024-11-28 02:29:45,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-28 02:29:45,893 INFO L124 PetriNetUnfolderBase]: 180/382 cut-off events.
[2024-11-28 02:29:45,893 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-28 02:29:45,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 382 events. 180/382 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1786 event pairs, 24 based on Foata normal form. 20/395 useless extension candidates. Maximal degree in co-relation 781. Up to 199 conditions per place.
[2024-11-28 02:29:45,896 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 29 selfloop transitions, 4 changer transitions 1/42 dead transitions.
[2024-11-28 02:29:45,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 168 flow
[2024-11-28 02:29:45,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-28 02:29:45,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-28 02:29:45,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions.
[2024-11-28 02:29:45,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3448275862068966
[2024-11-28 02:29:45,899 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 62 flow. Second operand 4 states and 80 transitions.
[2024-11-28 02:29:45,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 168 flow
[2024-11-28 02:29:45,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-28 02:29:45,902 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 87 flow
[2024-11-28 02:29:45,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=41, PETRI_TRANSITIONS=28}
[2024-11-28 02:29:45,906 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -20 predicate places.
[2024-11-28 02:29:45,906 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 87 flow
[2024-11-28 02:29:45,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:45,907 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-28 02:29:45,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 02:29:45,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-11-28 02:29:46,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 02:29:46,107 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] ===
[2024-11-28 02:29:46,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 02:29:46,108 INFO L85 PathProgramCache]: Analyzing trace with hash -992525509, now seen corresponding path program 1 times
[2024-11-28 02:29:46,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 02:29:46,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1847802168]
[2024-11-28 02:29:46,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 02:29:46,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 02:29:46,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 02:29:46,111 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 02:29:46,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-11-28 02:29:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 02:29:46,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-28 02:29:46,248 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 02:29:46,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-28 02:29:46,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-28 02:29:46,299 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 02:29:46,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847802168]
[2024-11-28 02:29:46,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847802168] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 02:29:46,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 02:29:46,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-28 02:29:46,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406126736]
[2024-11-28 02:29:46,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 02:29:46,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-28 02:29:46,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 02:29:46,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-28 02:29:46,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-28 02:29:46,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 58
[2024-11-28 02:29:46,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:46,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-28 02:29:46,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 58
[2024-11-28 02:29:46,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-28 02:29:46,494 INFO L124 PetriNetUnfolderBase]: 88/194 cut-off events.
[2024-11-28 02:29:46,494 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES.
[2024-11-28 02:29:46,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 194 events. 88/194 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 617 event pairs, 16 based on Foata normal form. 14/203 useless extension candidates. Maximal degree in co-relation 477. Up to 71 conditions per place.
[2024-11-28 02:29:46,495 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 25 selfloop transitions, 6 changer transitions 1/40 dead transitions.
[2024-11-28 02:29:46,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 182 flow
[2024-11-28 02:29:46,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-28 02:29:46,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-28 02:29:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions.
[2024-11-28 02:29:46,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30689655172413793
[2024-11-28 02:29:46,497 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 87 flow. Second operand 5 states and 89 transitions.
[2024-11-28 02:29:46,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 182 flow
[2024-11-28 02:29:46,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 173 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-11-28 02:29:46,499 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 103 flow
[2024-11-28 02:29:46,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=45, PETRI_TRANSITIONS=28}
[2024-11-28 02:29:46,500 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -16 predicate places.
[2024-11-28 02:29:46,500 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 103 flow
[2024-11-28 02:29:46,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:46,500 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-28 02:29:46,500 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 02:29:46,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-11-28 02:29:46,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 02:29:46,701 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] ===
[2024-11-28 02:29:46,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 02:29:46,702 INFO L85 PathProgramCache]: Analyzing trace with hash -151568525, now seen corresponding path program 1 times
[2024-11-28 02:29:46,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 02:29:46,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1188055992]
[2024-11-28 02:29:46,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 02:29:46,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 02:29:46,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 02:29:46,704 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 02:29:46,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-11-28 02:29:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 02:29:46,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-28 02:29:46,849 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 02:29:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-28 02:29:47,045 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-28 02:29:47,045 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 02:29:47,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188055992]
[2024-11-28 02:29:47,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188055992] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 02:29:47,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 02:29:47,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-28 02:29:47,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652324426]
[2024-11-28 02:29:47,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 02:29:47,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-28 02:29:47,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 02:29:47,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-28 02:29:47,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-11-28 02:29:47,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58
[2024-11-28 02:29:47,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 103 flow. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:47,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-28 02:29:47,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58
[2024-11-28 02:29:47,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-28 02:29:47,417 INFO L124 PetriNetUnfolderBase]: 150/324 cut-off events.
[2024-11-28 02:29:47,417 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES.
[2024-11-28 02:29:47,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 324 events. 150/324 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1203 event pairs, 43 based on Foata normal form. 4/325 useless extension candidates. Maximal degree in co-relation 817. Up to 114 conditions per place.
[2024-11-28 02:29:47,419 INFO L140 encePairwiseOnDemand]: 50/58 looper letters, 27 selfloop transitions, 5 changer transitions 23/61 dead transitions.
[2024-11-28 02:29:47,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 61 transitions, 325 flow
[2024-11-28 02:29:47,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-28 02:29:47,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-28 02:29:47,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions.
[2024-11-28 02:29:47,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2881773399014778
[2024-11-28 02:29:47,421 INFO L175 Difference]: Start difference. First operand has 45 places, 28 transitions, 103 flow. Second operand 7 states and 117 transitions.
[2024-11-28 02:29:47,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 61 transitions, 325 flow
[2024-11-28 02:29:47,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 268 flow, removed 10 selfloop flow, removed 6 redundant places.
[2024-11-28 02:29:47,424 INFO L231 Difference]: Finished difference. Result has 50 places, 30 transitions, 110 flow
[2024-11-28 02:29:47,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=50, PETRI_TRANSITIONS=30}
[2024-11-28 02:29:47,425 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -11 predicate places.
[2024-11-28 02:29:47,425 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 30 transitions, 110 flow
[2024-11-28 02:29:47,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 02:29:47,426 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-28 02:29:47,426 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 02:29:47,437 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-11-28 02:29:47,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 02:29:47,626 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] ===
[2024-11-28 02:29:47,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 02:29:47,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1598333385, now seen corresponding path program 2 times
[2024-11-28 02:29:47,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 02:29:47,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [42800425]
[2024-11-28 02:29:47,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-28 02:29:47,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 02:29:47,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 02:29:47,632 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 02:29:47,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-11-28 02:29:47,774 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-28 02:29:47,774 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-28 02:29:47,774 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-28 02:29:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-28 02:29:47,888 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace
[2024-11-28 02:29:47,889 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-11-28 02:29:47,890 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (45 of 46 remaining)
[2024-11-28 02:29:47,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 46 remaining)
[2024-11-28 02:29:47,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 46 remaining)
[2024-11-28 02:29:47,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 46 remaining)
[2024-11-28 02:29:47,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 46 remaining)
[2024-11-28 02:29:47,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 46 remaining)
[2024-11-28 02:29:47,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 46 remaining)
[2024-11-28 02:29:47,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 46 remaining)
[2024-11-28 02:29:47,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 46 remaining)
[2024-11-28 02:29:47,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 46 remaining)
[2024-11-28 02:29:47,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 46 remaining)
[2024-11-28 02:29:47,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 46 remaining)
[2024-11-28 02:29:47,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 46 remaining)
[2024-11-28 02:29:47,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 46 remaining)
[2024-11-28 02:29:47,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 46 remaining)
[2024-11-28 02:29:47,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 46 remaining)
[2024-11-28 02:29:47,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 46 remaining)
[2024-11-28 02:29:47,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 46 remaining)
[2024-11-28 02:29:47,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 46 remaining)
[2024-11-28 02:29:47,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 46 remaining)
[2024-11-28 02:29:47,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 46 remaining)
[2024-11-28 02:29:47,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 46 remaining)
[2024-11-28 02:29:47,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 46 remaining)
[2024-11-28 02:29:47,895 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 46 remaining)
[2024-11-28 02:29:47,895 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 46 remaining)
[2024-11-28 02:29:47,895 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (20 of 46 remaining)
[2024-11-28 02:29:47,895 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 46 remaining)
[2024-11-28 02:29:47,895 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 46 remaining)
[2024-11-28 02:29:47,895 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 46 remaining)
[2024-11-28 02:29:47,895 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 46 remaining)
[2024-11-28 02:29:47,895 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 46 remaining)
[2024-11-28 02:29:47,896 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 46 remaining)
[2024-11-28 02:29:47,896 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 46 remaining)
[2024-11-28 02:29:47,896 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 46 remaining)
[2024-11-28 02:29:47,896 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 46 remaining)
[2024-11-28 02:29:47,896 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 46 remaining)
[2024-11-28 02:29:47,896 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 46 remaining)
[2024-11-28 02:29:47,896 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 46 remaining)
[2024-11-28 02:29:47,896 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 46 remaining)
[2024-11-28 02:29:47,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 46 remaining)
[2024-11-28 02:29:47,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 46 remaining)
[2024-11-28 02:29:47,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 46 remaining)
[2024-11-28 02:29:47,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 46 remaining)
[2024-11-28 02:29:47,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 46 remaining)
[2024-11-28 02:29:47,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 46 remaining)
[2024-11-28 02:29:47,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 46 remaining)
[2024-11-28 02:29:47,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2024-11-28 02:29:48,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 02:29:48,098 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 02:29:48,174 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-28 02:29:48,174 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-28 02:29:48,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:29:48 BasicIcfg
[2024-11-28 02:29:48,183 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-28 02:29:48,184 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-28 02:29:48,184 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-28 02:29:48,184 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-28 02:29:48,185 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:29:40" (3/4) ...
[2024-11-28 02:29:48,187 INFO L149 WitnessPrinter]: No result that supports witness generation found
[2024-11-28 02:29:48,188 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-28 02:29:48,189 INFO L158 Benchmark]: Toolchain (without parser) took 9818.32ms. Allocated memory was 117.4MB in the beginning and 276.8MB in the end (delta: 159.4MB). Free memory was 90.9MB in the beginning and 91.1MB in the end (delta: -183.2kB). Peak memory consumption was 154.6MB. Max. memory is 16.1GB.
[2024-11-28 02:29:48,189 INFO L158 Benchmark]: CDTParser took 0.70ms. Allocated memory is still 117.4MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-28 02:29:48,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.21ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 67.9MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-28 02:29:48,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.62ms. Allocated memory is still 117.4MB. Free memory was 67.9MB in the beginning and 65.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-28 02:29:48,190 INFO L158 Benchmark]: Boogie Preprocessor took 58.75ms. Allocated memory is still 117.4MB. Free memory was 65.7MB in the beginning and 62.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-28 02:29:48,190 INFO L158 Benchmark]: RCFGBuilder took 1625.59ms. Allocated memory was 117.4MB in the beginning and 276.8MB in the end (delta: 159.4MB). Free memory was 62.7MB in the beginning and 228.0MB in the end (delta: -165.3MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB.
[2024-11-28 02:29:48,191 INFO L158 Benchmark]: TraceAbstraction took 7533.76ms. Allocated memory is still 276.8MB. Free memory was 228.0MB in the beginning and 91.2MB in the end (delta: 136.9MB). Peak memory consumption was 129.4MB. Max. memory is 16.1GB.
[2024-11-28 02:29:48,191 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 276.8MB. Free memory was 91.2MB in the beginning and 91.1MB in the end (delta: 83.0kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-28 02:29:48,193 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.70ms. Allocated memory is still 117.4MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 527.21ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 67.9MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 60.62ms. Allocated memory is still 117.4MB. Free memory was 67.9MB in the beginning and 65.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 58.75ms. Allocated memory is still 117.4MB. Free memory was 65.7MB in the beginning and 62.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 1625.59ms. Allocated memory was 117.4MB in the beginning and 276.8MB in the end (delta: 159.4MB). Free memory was 62.7MB in the beginning and 228.0MB in the end (delta: -165.3MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB.
* TraceAbstraction took 7533.76ms. Allocated memory is still 276.8MB. Free memory was 228.0MB in the beginning and 91.2MB in the end (delta: 136.9MB). Peak memory consumption was 129.4MB. Max. memory is 16.1GB.
* Witness Printer took 3.93ms. Allocated memory is still 276.8MB. Free memory was 91.2MB in the beginning and 91.1MB in the end (delta: 83.0kB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 18.
Possible FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p0_EAX = 0;
[L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed;
[L713] 0 int __unbuffered_p0_EAX$mem_tmp;
[L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0;
[L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1;
[L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2;
[L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0;
[L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1;
[L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2;
[L720] 0 _Bool __unbuffered_p0_EAX$read_delayed;
[L721] 0 int *__unbuffered_p0_EAX$read_delayed_var;
[L722] 0 int __unbuffered_p0_EAX$w_buff0;
[L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used;
[L724] 0 int __unbuffered_p0_EAX$w_buff1;
[L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used;
[L727] 0 int __unbuffered_p1_EAX = 0;
[L728] 0 _Bool main$tmp_guard0;
[L729] 0 _Bool main$tmp_guard1;
[L731] 0 int x = 0;
[L733] 0 int y = 0;
[L733] 0 int y = 0;
[L734] 0 _Bool y$flush_delayed;
[L735] 0 int y$mem_tmp;
[L736] 0 _Bool y$r_buff0_thd0;
[L737] 0 _Bool y$r_buff0_thd1;
[L738] 0 _Bool y$r_buff0_thd2;
[L739] 0 _Bool y$r_buff1_thd0;
[L740] 0 _Bool y$r_buff1_thd1;
[L741] 0 _Bool y$r_buff1_thd2;
[L742] 0 _Bool y$read_delayed;
[L743] 0 int *y$read_delayed_var;
[L744] 0 int y$w_buff0;
[L745] 0 _Bool y$w_buff0_used;
[L746] 0 int y$w_buff1;
[L747] 0 _Bool y$w_buff1_used;
[L748] 0 _Bool weak$$choice0;
[L749] 0 _Bool weak$$choice1;
[L750] 0 _Bool weak$$choice2;
[L812] 0 pthread_t t1929;
[L813] FCALL, FORK 0 pthread_create(&t1929, ((void *)0), P0, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1929=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L754] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L755] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L756] 1 y$flush_delayed = weak$$choice2
[L757] EXPR 1 \read(y)
[L757] 1 y$mem_tmp = y
[L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L758] EXPR 1 \read(y)
[L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L765] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1
[L766] 1 __unbuffered_p0_EAX$read_delayed_var = &y
[L767] EXPR 1 \read(y)
[L767] 1 __unbuffered_p0_EAX = y
[L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y
[L768] EXPR 1 \read(y)
[L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y
[L768] 1 y = y$flush_delayed ? y$mem_tmp : y
[L769] 1 y$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L814] 0 pthread_t t1930;
[L815] FCALL, FORK 0 pthread_create(&t1930, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1929=-1, t1930=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L772] 1 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L784] 2 __unbuffered_p1_EAX = x
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L787] 2 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L790] EXPR 2 \read(y)
[L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929=-1, t1930=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L819] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L4] COND FALSE 0 !(!cond)
[L819] RET 0 assume_abort_if_not(main$tmp_guard0)
[L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L821] EXPR 0 \read(y)
[L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929=-1, t1930=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L828] 0 weak$$choice1 = __VERIFIER_nondet_bool()
[L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L829] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var)
[L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L829] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L830] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929=-1, t1930=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L832] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L19] COND TRUE 0 !expression
[L19] CALL 0 reach_error()
[L18] COND FALSE 0 !(0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L18] 0 __assert_fail ("0", "safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: 810]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 815]: 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: 813]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 5 procedures, 91 locations, 46 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 246 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 231 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 444 IncrementalHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 16 mSDtfsCounter, 444 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=0, InterpolantAutomatonStates: 36, 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.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 544 SizeOfPredicates, 13 NumberOfNonLiveVariables, 928 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-11-28 02:29:48,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf5a225-aa51-4865-af05-b52dbd4b50fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
UNKNOWN: Overapproximated counterexample