./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031.oepc.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_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1 --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 c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-d790fec
[2024-12-02 14:09:39,019 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-12-02 14:09:39,077 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2024-12-02 14:09:39,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-12-02 14:09:39,082 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-12-02 14:09:39,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-12-02 14:09:39,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-12-02 14:09:39,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-12-02 14:09:39,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-12-02 14:09:39,105 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-12-02 14:09:39,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-12-02 14:09:39,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-12-02 14:09:39,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-12-02 14:09:39,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-12-02 14:09:39,106 INFO L153 SettingsManager]: * Use SBE=true
[2024-12-02 14:09:39,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-12-02 14:09:39,106 INFO L153 SettingsManager]: * sizeof long=4
[2024-12-02 14:09:39,107 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-12-02 14:09:39,107 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-12-02 14:09:39,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-12-02 14:09:39,107 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-12-02 14:09:39,107 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-12-02 14:09:39,107 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-12-02 14:09:39,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-12-02 14:09:39,107 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-12-02 14:09:39,107 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-12-02 14:09:39,107 INFO L153 SettingsManager]: * sizeof long double=12
[2024-12-02 14:09:39,107 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-12-02 14:09:39,107 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-12-02 14:09:39,108 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-12-02 14:09:39,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-12-02 14:09:39,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-12-02 14:09:39,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-12-02 14:09:39,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 14:09:39,108 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-12-02 14:09:39,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-12-02 14:09:39,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-12-02 14:09:39,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-12-02 14:09:39,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 14:09:39,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-12-02 14:09:39,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-12-02 14:09:39,109 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-12-02 14:09:39,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-12-02 14:09:39,109 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-12-02 14:09:39,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-12-02 14:09:39,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-12-02 14:09:39,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-12-02 14:09:39,109 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_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1
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 -> c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf
[2024-12-02 14:09:39,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-12-02 14:09:39,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-12-02 14:09:39,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-12-02 14:09:39,345 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-12-02 14:09:39,346 INFO L274 PluginConnector]: CDTParser initialized
[2024-12-02 14:09:39,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-wmm/mix031.oepc.i
[2024-12-02 14:09:41,938 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/data/8c50c1abc/aad191db6d8144479f9cceb5e1cacbad/FLAG6aa729f62
[2024-12-02 14:09:42,200 INFO L384 CDTParser]: Found 1 translation units.
[2024-12-02 14:09:42,201 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/sv-benchmarks/c/pthread-wmm/mix031.oepc.i
[2024-12-02 14:09:42,214 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/data/8c50c1abc/aad191db6d8144479f9cceb5e1cacbad/FLAG6aa729f62
[2024-12-02 14:09:42,522 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/data/8c50c1abc/aad191db6d8144479f9cceb5e1cacbad
[2024-12-02 14:09:42,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-12-02 14:09:42,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-12-02 14:09:42,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-12-02 14:09:42,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-12-02 14:09:42,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-12-02 14:09:42,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:09:42" (1/1) ...
[2024-12-02 14:09:42,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6315e596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:42, skipping insertion in model container
[2024-12-02 14:09:42,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:09:42" (1/1) ...
[2024-12-02 14:09:42,559 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-12-02 14:09:42,806 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-12-02 14:09:42,816 INFO L200 MainTranslator]: Completed pre-run
[2024-12-02 14:09:42,869 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-12-02 14:09:42,903 INFO L204 MainTranslator]: Completed translation
[2024-12-02 14:09:42,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:42 WrapperNode
[2024-12-02 14:09:42,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-12-02 14:09:42,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-12-02 14:09:42,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-12-02 14:09:42,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-12-02 14:09:42,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:42" (1/1) ...
[2024-12-02 14:09:42,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:42" (1/1) ...
[2024-12-02 14:09:42,943 INFO L138 Inliner]: procedures = 174, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 118
[2024-12-02 14:09:42,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-12-02 14:09:42,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-12-02 14:09:42,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-12-02 14:09:42,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-12-02 14:09:42,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:42" (1/1) ...
[2024-12-02 14:09:42,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:42" (1/1) ...
[2024-12-02 14:09:42,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:42" (1/1) ...
[2024-12-02 14:09:42,970 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-12-02 14:09:42,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:42" (1/1) ...
[2024-12-02 14:09:42,970 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:42" (1/1) ...
[2024-12-02 14:09:42,977 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:42" (1/1) ...
[2024-12-02 14:09:42,978 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:42" (1/1) ...
[2024-12-02 14:09:42,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:42" (1/1) ...
[2024-12-02 14:09:42,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:42" (1/1) ...
[2024-12-02 14:09:42,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:42" (1/1) ...
[2024-12-02 14:09:42,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-12-02 14:09:42,985 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-12-02 14:09:42,985 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-12-02 14:09:42,985 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-12-02 14:09:42,986 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:42" (1/1) ...
[2024-12-02 14:09:42,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 14:09:43,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3
[2024-12-02 14:09:43,015 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-12-02 14:09:43,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-12-02 14:09:43,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-12-02 14:09:43,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-12-02 14:09:43,043 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-12-02 14:09:43,043 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-12-02 14:09:43,043 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-12-02 14:09:43,043 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-12-02 14:09:43,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-12-02 14:09:43,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-12-02 14:09:43,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-12-02 14:09:43,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-12-02 14:09:43,044 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-12-02 14:09:43,147 INFO L234 CfgBuilder]: Building ICFG
[2024-12-02 14:09:43,148 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-12-02 14:09:43,380 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-12-02 14:09:43,380 INFO L283 CfgBuilder]: Performing block encoding
[2024-12-02 14:09:43,530 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-12-02 14:09:43,531 INFO L312 CfgBuilder]: Removed 0 assume(true) statements.
[2024-12-02 14:09:43,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:09:43 BoogieIcfgContainer
[2024-12-02 14:09:43,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-12-02 14:09:43,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-12-02 14:09:43,533 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-12-02 14:09:43,537 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-12-02 14:09:43,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:09:42" (1/3) ...
[2024-12-02 14:09:43,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd40ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:09:43, skipping insertion in model container
[2024-12-02 14:09:43,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:42" (2/3) ...
[2024-12-02 14:09:43,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd40ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:09:43, skipping insertion in model container
[2024-12-02 14:09:43,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:09:43" (3/3) ...
[2024-12-02 14:09:43,539 INFO L128 eAbstractionObserver]: Analyzing ICFG mix031.oepc.i
[2024-12-02 14:09:43,549 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-12-02 14:09:43,551 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix031.oepc.i that has 3 procedures, 38 locations, 1 initial locations, 0 loop locations, and 3 error locations.
[2024-12-02 14:09:43,551 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-12-02 14:09:43,592 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-12-02 14:09:43,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 86 flow
[2024-12-02 14:09:43,641 INFO L124 PetriNetUnfolderBase]: 2/37 cut-off events.
[2024-12-02 14:09:43,643 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-02 14:09:43,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 37 events. 2/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place.
[2024-12-02 14:09:43,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 86 flow
[2024-12-02 14:09:43,648 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 37 transitions, 80 flow
[2024-12-02 14:09:43,654 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-12-02 14:09:43,665 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;@2798dad3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-12-02 14:09:43,665 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-12-02 14:09:43,668 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-12-02 14:09:43,669 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-12-02 14:09:43,669 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-02 14:09:43,669 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 14:09:43,669 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-12-02 14:09:43,670 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 14:09:43,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 14:09:43,674 INFO L85 PathProgramCache]: Analyzing trace with hash 11132310, now seen corresponding path program 1 times
[2024-12-02 14:09:43,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 14:09:43,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854686386]
[2024-12-02 14:09:43,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 14:09:43,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 14:09:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 14:09:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 14:09:43,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 14:09:43,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854686386]
[2024-12-02 14:09:43,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854686386] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 14:09:43,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 14:09:43,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-12-02 14:09:43,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542653381]
[2024-12-02 14:09:43,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 14:09:44,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 14:09:44,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 14:09:44,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 14:09:44,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 14:09:44,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 39
[2024-12-02 14:09:44,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-12-02 14:09:44,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 14:09:44,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 39
[2024-12-02 14:09:44,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 14:09:44,232 INFO L124 PetriNetUnfolderBase]: 183/483 cut-off events.
[2024-12-02 14:09:44,232 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2024-12-02 14:09:44,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 483 events. 183/483 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2797 event pairs, 21 based on Foata normal form. 32/510 useless extension candidates. Maximal degree in co-relation 807. Up to 265 conditions per place.
[2024-12-02 14:09:44,236 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 25 selfloop transitions, 2 changer transitions 2/45 dead transitions.
[2024-12-02 14:09:44,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 157 flow
[2024-12-02 14:09:44,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 14:09:44,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 14:09:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions.
[2024-12-02 14:09:44,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521367521367521
[2024-12-02 14:09:44,248 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 80 flow. Second operand 3 states and 88 transitions.
[2024-12-02 14:09:44,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 157 flow
[2024-12-02 14:09:44,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 14:09:44,254 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 72 flow
[2024-12-02 14:09:44,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=32}
[2024-12-02 14:09:44,258 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places.
[2024-12-02 14:09:44,259 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 72 flow
[2024-12-02 14:09:44,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-12-02 14:09:44,259 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 14:09:44,259 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 14:09:44,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-12-02 14:09:44,259 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 14:09:44,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 14:09:44,260 INFO L85 PathProgramCache]: Analyzing trace with hash -586911496, now seen corresponding path program 1 times
[2024-12-02 14:09:44,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 14:09:44,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936049996]
[2024-12-02 14:09:44,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 14:09:44,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 14:09:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 14:09:44,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 14:09:44,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 14:09:44,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936049996]
[2024-12-02 14:09:44,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936049996] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 14:09:44,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 14:09:44,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-12-02 14:09:44,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251508917]
[2024-12-02 14:09:44,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 14:09:44,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 14:09:44,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 14:09:44,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 14:09:44,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 14:09:44,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 39
[2024-12-02 14:09:44,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-12-02 14:09:44,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 14:09:44,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 39
[2024-12-02 14:09:44,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 14:09:44,412 INFO L124 PetriNetUnfolderBase]: 159/381 cut-off events.
[2024-12-02 14:09:44,412 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES.
[2024-12-02 14:09:44,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 381 events. 159/381 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2116 event pairs, 159 based on Foata normal form. 16/380 useless extension candidates. Maximal degree in co-relation 695. Up to 280 conditions per place.
[2024-12-02 14:09:44,415 INFO L140 encePairwiseOnDemand]: 37/39 looper letters, 14 selfloop transitions, 1 changer transitions 1/31 dead transitions.
[2024-12-02 14:09:44,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 102 flow
[2024-12-02 14:09:44,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 14:09:44,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 14:09:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions.
[2024-12-02 14:09:44,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5811965811965812
[2024-12-02 14:09:44,417 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 72 flow. Second operand 3 states and 68 transitions.
[2024-12-02 14:09:44,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 102 flow
[2024-12-02 14:09:44,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 98 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 14:09:44,418 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 66 flow
[2024-12-02 14:09:44,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, 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=66, PETRI_PLACES=38, PETRI_TRANSITIONS=30}
[2024-12-02 14:09:44,419 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places.
[2024-12-02 14:09:44,419 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 66 flow
[2024-12-02 14:09:44,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-12-02 14:09:44,419 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 14:09:44,420 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 14:09:44,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-12-02 14:09:44,420 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 14:09:44,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 14:09:44,420 INFO L85 PathProgramCache]: Analyzing trace with hash -586910067, now seen corresponding path program 1 times
[2024-12-02 14:09:44,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 14:09:44,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328347290]
[2024-12-02 14:09:44,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 14:09:44,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 14:09:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 14:09:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 14:09:44,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 14:09:44,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328347290]
[2024-12-02 14:09:44,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328347290] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 14:09:44,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 14:09:44,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-12-02 14:09:44,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765825953]
[2024-12-02 14:09:44,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 14:09:44,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-12-02 14:09:44,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 14:09:44,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-12-02 14:09:44,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-12-02 14:09:44,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39
[2024-12-02 14:09:44,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-12-02 14:09:44,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 14:09:44,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39
[2024-12-02 14:09:44,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 14:09:44,981 INFO L124 PetriNetUnfolderBase]: 476/918 cut-off events.
[2024-12-02 14:09:44,981 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-02 14:09:44,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1747 conditions, 918 events. 476/918 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5230 event pairs, 176 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 1741. Up to 512 conditions per place.
[2024-12-02 14:09:44,986 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 24 selfloop transitions, 3 changer transitions 39/76 dead transitions.
[2024-12-02 14:09:44,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 76 transitions, 292 flow
[2024-12-02 14:09:44,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-12-02 14:09:44,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-12-02 14:09:44,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions.
[2024-12-02 14:09:44,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513
[2024-12-02 14:09:44,988 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 66 flow. Second operand 8 states and 172 transitions.
[2024-12-02 14:09:44,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 76 transitions, 292 flow
[2024-12-02 14:09:44,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 76 transitions, 291 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-12-02 14:09:44,990 INFO L231 Difference]: Finished difference. Result has 48 places, 31 transitions, 98 flow
[2024-12-02 14:09:44,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=98, PETRI_PLACES=48, PETRI_TRANSITIONS=31}
[2024-12-02 14:09:44,991 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places.
[2024-12-02 14:09:44,991 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 98 flow
[2024-12-02 14:09:44,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-12-02 14:09:44,992 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 14:09:44,992 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 14:09:44,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-12-02 14:09:44,992 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 14:09:44,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 14:09:44,993 INFO L85 PathProgramCache]: Analyzing trace with hash -228803062, now seen corresponding path program 1 times
[2024-12-02 14:09:44,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 14:09:44,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974187701]
[2024-12-02 14:09:44,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 14:09:44,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 14:09:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 14:09:45,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 14:09:45,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 14:09:45,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974187701]
[2024-12-02 14:09:45,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974187701] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 14:09:45,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 14:09:45,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-12-02 14:09:45,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202195610]
[2024-12-02 14:09:45,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 14:09:45,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-12-02 14:09:45,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 14:09:45,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-12-02 14:09:45,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-12-02 14:09:45,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39
[2024-12-02 14:09:45,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 98 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 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-12-02 14:09:45,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 14:09:45,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39
[2024-12-02 14:09:45,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 14:09:45,540 INFO L124 PetriNetUnfolderBase]: 337/682 cut-off events.
[2024-12-02 14:09:45,540 INFO L125 PetriNetUnfolderBase]: For 410/410 co-relation queries the response was YES.
[2024-12-02 14:09:45,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 682 events. 337/682 cut-off events. For 410/410 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3513 event pairs, 79 based on Foata normal form. 20/694 useless extension candidates. Maximal degree in co-relation 1624. Up to 435 conditions per place.
[2024-12-02 14:09:45,543 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 25 selfloop transitions, 3 changer transitions 23/61 dead transitions.
[2024-12-02 14:09:45,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 282 flow
[2024-12-02 14:09:45,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-12-02 14:09:45,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-12-02 14:09:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions.
[2024-12-02 14:09:45,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238
[2024-12-02 14:09:45,545 INFO L175 Difference]: Start difference. First operand has 48 places, 31 transitions, 98 flow. Second operand 7 states and 143 transitions.
[2024-12-02 14:09:45,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 282 flow
[2024-12-02 14:09:45,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 265 flow, removed 7 selfloop flow, removed 3 redundant places.
[2024-12-02 14:09:45,550 INFO L231 Difference]: Finished difference. Result has 50 places, 31 transitions, 108 flow
[2024-12-02 14:09:45,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=108, PETRI_PLACES=50, PETRI_TRANSITIONS=31}
[2024-12-02 14:09:45,551 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places.
[2024-12-02 14:09:45,551 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 31 transitions, 108 flow
[2024-12-02 14:09:45,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 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-12-02 14:09:45,551 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 14:09:45,551 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 14:09:45,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-12-02 14:09:45,552 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 14:09:45,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 14:09:45,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1972854197, now seen corresponding path program 1 times
[2024-12-02 14:09:45,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 14:09:45,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150487670]
[2024-12-02 14:09:45,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 14:09:45,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 14:09:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 14:09:45,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 14:09:45,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 14:09:45,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150487670]
[2024-12-02 14:09:45,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150487670] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 14:09:45,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 14:09:45,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-12-02 14:09:45,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438635622]
[2024-12-02 14:09:45,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 14:09:45,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-12-02 14:09:45,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 14:09:45,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-12-02 14:09:45,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-12-02 14:09:45,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39
[2024-12-02 14:09:45,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 31 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-12-02 14:09:45,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 14:09:45,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39
[2024-12-02 14:09:45,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 14:09:45,921 INFO L124 PetriNetUnfolderBase]: 218/477 cut-off events.
[2024-12-02 14:09:45,921 INFO L125 PetriNetUnfolderBase]: For 429/430 co-relation queries the response was YES.
[2024-12-02 14:09:45,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 477 events. 218/477 cut-off events. For 429/430 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2403 event pairs, 110 based on Foata normal form. 20/484 useless extension candidates. Maximal degree in co-relation 1144. Up to 224 conditions per place.
[2024-12-02 14:09:45,924 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 23 selfloop transitions, 3 changer transitions 23/62 dead transitions.
[2024-12-02 14:09:45,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 298 flow
[2024-12-02 14:09:45,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-12-02 14:09:45,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-12-02 14:09:45,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions.
[2024-12-02 14:09:45,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5677655677655677
[2024-12-02 14:09:45,926 INFO L175 Difference]: Start difference. First operand has 50 places, 31 transitions, 108 flow. Second operand 7 states and 155 transitions.
[2024-12-02 14:09:45,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 298 flow
[2024-12-02 14:09:45,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 62 transitions, 268 flow, removed 12 selfloop flow, removed 6 redundant places.
[2024-12-02 14:09:45,929 INFO L231 Difference]: Finished difference. Result has 51 places, 31 transitions, 109 flow
[2024-12-02 14:09:45,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=109, PETRI_PLACES=51, PETRI_TRANSITIONS=31}
[2024-12-02 14:09:45,930 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places.
[2024-12-02 14:09:45,930 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 31 transitions, 109 flow
[2024-12-02 14:09:45,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-12-02 14:09:45,930 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 14:09:45,930 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]
[2024-12-02 14:09:45,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-12-02 14:09:45,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 14:09:45,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 14:09:45,931 INFO L85 PathProgramCache]: Analyzing trace with hash 589751112, now seen corresponding path program 1 times
[2024-12-02 14:09:45,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 14:09:45,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246911435]
[2024-12-02 14:09:45,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 14:09:45,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 14:09:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 14:09:46,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 14:09:46,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 14:09:46,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246911435]
[2024-12-02 14:09:46,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246911435] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 14:09:46,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 14:09:46,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-12-02 14:09:46,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890320447]
[2024-12-02 14:09:46,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 14:09:46,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-12-02 14:09:46,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 14:09:46,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-12-02 14:09:46,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-12-02 14:09:46,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39
[2024-12-02 14:09:46,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 31 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-12-02 14:09:46,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 14:09:46,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39
[2024-12-02 14:09:46,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 14:09:46,167 INFO L124 PetriNetUnfolderBase]: 202/441 cut-off events.
[2024-12-02 14:09:46,167 INFO L125 PetriNetUnfolderBase]: For 172/174 co-relation queries the response was YES.
[2024-12-02 14:09:46,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 441 events. 202/441 cut-off events. For 172/174 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1981 event pairs, 42 based on Foata normal form. 29/454 useless extension candidates. Maximal degree in co-relation 973. Up to 190 conditions per place.
[2024-12-02 14:09:46,170 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 32 selfloop transitions, 4 changer transitions 0/49 dead transitions.
[2024-12-02 14:09:46,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 49 transitions, 219 flow
[2024-12-02 14:09:46,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-12-02 14:09:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-12-02 14:09:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions.
[2024-12-02 14:09:46,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282
[2024-12-02 14:09:46,171 INFO L175 Difference]: Start difference. First operand has 51 places, 31 transitions, 109 flow. Second operand 4 states and 98 transitions.
[2024-12-02 14:09:46,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 49 transitions, 219 flow
[2024-12-02 14:09:46,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 199 flow, removed 7 selfloop flow, removed 8 redundant places.
[2024-12-02 14:09:46,174 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 119 flow
[2024-12-02 14:09:46,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=44, PETRI_TRANSITIONS=34}
[2024-12-02 14:09:46,174 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places.
[2024-12-02 14:09:46,175 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 119 flow
[2024-12-02 14:09:46,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-12-02 14:09:46,175 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 14:09:46,175 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, 1]
[2024-12-02 14:09:46,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-12-02 14:09:46,175 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 14:09:46,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 14:09:46,176 INFO L85 PathProgramCache]: Analyzing trace with hash 760489293, now seen corresponding path program 1 times
[2024-12-02 14:09:46,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 14:09:46,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080836649]
[2024-12-02 14:09:46,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 14:09:46,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 14:09:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 14:09:46,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 14:09:46,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 14:09:46,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080836649]
[2024-12-02 14:09:46,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080836649] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 14:09:46,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 14:09:46,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-12-02 14:09:46,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889939836]
[2024-12-02 14:09:46,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 14:09:46,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-12-02 14:09:46,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 14:09:46,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-12-02 14:09:46,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-12-02 14:09:46,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39
[2024-12-02 14:09:46,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-12-02 14:09:46,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 14:09:46,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39
[2024-12-02 14:09:46,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 14:09:46,482 INFO L124 PetriNetUnfolderBase]: 134/299 cut-off events.
[2024-12-02 14:09:46,482 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES.
[2024-12-02 14:09:46,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 299 events. 134/299 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1177 event pairs, 43 based on Foata normal form. 18/300 useless extension candidates. Maximal degree in co-relation 719. Up to 117 conditions per place.
[2024-12-02 14:09:46,484 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 28 selfloop transitions, 6 changer transitions 0/47 dead transitions.
[2024-12-02 14:09:46,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 218 flow
[2024-12-02 14:09:46,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-12-02 14:09:46,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-12-02 14:09:46,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions.
[2024-12-02 14:09:46,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5692307692307692
[2024-12-02 14:09:46,485 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 119 flow. Second operand 5 states and 111 transitions.
[2024-12-02 14:09:46,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 218 flow
[2024-12-02 14:09:46,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 203 flow, removed 3 selfloop flow, removed 3 redundant places.
[2024-12-02 14:09:46,487 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 134 flow
[2024-12-02 14:09:46,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=47, PETRI_TRANSITIONS=35}
[2024-12-02 14:09:46,487 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places.
[2024-12-02 14:09:46,487 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 134 flow
[2024-12-02 14:09:46,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-12-02 14:09:46,488 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 14:09:46,488 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, 1, 1, 1, 1]
[2024-12-02 14:09:46,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-12-02 14:09:46,488 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 14:09:46,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 14:09:46,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1618141854, now seen corresponding path program 1 times
[2024-12-02 14:09:46,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 14:09:46,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494574738]
[2024-12-02 14:09:46,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 14:09:46,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 14:09:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 14:09:47,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 14:09:47,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 14:09:47,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494574738]
[2024-12-02 14:09:47,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494574738] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 14:09:47,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 14:09:47,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-12-02 14:09:47,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846185691]
[2024-12-02 14:09:47,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 14:09:47,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-12-02 14:09:47,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 14:09:47,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-12-02 14:09:47,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-12-02 14:09:47,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39
[2024-12-02 14:09:47,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 134 flow. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 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-12-02 14:09:47,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 14:09:47,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39
[2024-12-02 14:09:47,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 14:09:47,399 INFO L124 PetriNetUnfolderBase]: 147/406 cut-off events.
[2024-12-02 14:09:47,399 INFO L125 PetriNetUnfolderBase]: For 326/362 co-relation queries the response was YES.
[2024-12-02 14:09:47,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 406 events. 147/406 cut-off events. For 326/362 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2115 event pairs, 60 based on Foata normal form. 10/380 useless extension candidates. Maximal degree in co-relation 981. Up to 127 conditions per place.
[2024-12-02 14:09:47,401 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 23 selfloop transitions, 6 changer transitions 17/65 dead transitions.
[2024-12-02 14:09:47,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 65 transitions, 306 flow
[2024-12-02 14:09:47,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-12-02 14:09:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-12-02 14:09:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 175 transitions.
[2024-12-02 14:09:47,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5608974358974359
[2024-12-02 14:09:47,402 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 134 flow. Second operand 8 states and 175 transitions.
[2024-12-02 14:09:47,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 65 transitions, 306 flow
[2024-12-02 14:09:47,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 297 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-12-02 14:09:47,404 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 170 flow
[2024-12-02 14:09:47,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=170, PETRI_PLACES=57, PETRI_TRANSITIONS=40}
[2024-12-02 14:09:47,404 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places.
[2024-12-02 14:09:47,405 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 170 flow
[2024-12-02 14:09:47,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 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-12-02 14:09:47,405 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 14:09:47,405 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, 1, 1, 1, 1]
[2024-12-02 14:09:47,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-12-02 14:09:47,405 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 14:09:47,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 14:09:47,406 INFO L85 PathProgramCache]: Analyzing trace with hash -664899734, now seen corresponding path program 2 times
[2024-12-02 14:09:47,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 14:09:47,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555608133]
[2024-12-02 14:09:47,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-12-02 14:09:47,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 14:09:47,445 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-12-02 14:09:47,446 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-12-02 14:09:48,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 14:09:48,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 14:09:48,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555608133]
[2024-12-02 14:09:48,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555608133] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 14:09:48,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 14:09:48,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-12-02 14:09:48,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103334312]
[2024-12-02 14:09:48,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 14:09:48,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-12-02 14:09:48,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 14:09:48,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-12-02 14:09:48,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-12-02 14:09:48,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39
[2024-12-02 14:09:48,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 170 flow. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 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-12-02 14:09:48,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 14:09:48,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39
[2024-12-02 14:09:48,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 14:09:48,526 INFO L124 PetriNetUnfolderBase]: 289/674 cut-off events.
[2024-12-02 14:09:48,526 INFO L125 PetriNetUnfolderBase]: For 443/479 co-relation queries the response was YES.
[2024-12-02 14:09:48,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1819 conditions, 674 events. 289/674 cut-off events. For 443/479 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3753 event pairs, 65 based on Foata normal form. 12/638 useless extension candidates. Maximal degree in co-relation 1801. Up to 218 conditions per place.
[2024-12-02 14:09:48,529 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 34 selfloop transitions, 20 changer transitions 27/94 dead transitions.
[2024-12-02 14:09:48,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 94 transitions, 523 flow
[2024-12-02 14:09:48,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-12-02 14:09:48,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-12-02 14:09:48,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 216 transitions.
[2024-12-02 14:09:48,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156
[2024-12-02 14:09:48,531 INFO L175 Difference]: Start difference. First operand has 57 places, 40 transitions, 170 flow. Second operand 12 states and 216 transitions.
[2024-12-02 14:09:48,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 94 transitions, 523 flow
[2024-12-02 14:09:48,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 94 transitions, 513 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-12-02 14:09:48,536 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 272 flow
[2024-12-02 14:09:48,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=272, PETRI_PLACES=66, PETRI_TRANSITIONS=50}
[2024-12-02 14:09:48,536 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places.
[2024-12-02 14:09:48,537 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 272 flow
[2024-12-02 14:09:48,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 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-12-02 14:09:48,537 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 14:09:48,537 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, 1, 1, 1, 1]
[2024-12-02 14:09:48,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-12-02 14:09:48,537 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 14:09:48,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 14:09:48,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1632058644, now seen corresponding path program 3 times
[2024-12-02 14:09:48,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 14:09:48,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857639862]
[2024-12-02 14:09:48,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-12-02 14:09:48,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 14:09:48,620 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-12-02 14:09:48,620 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat
[2024-12-02 14:09:48,620 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-12-02 14:09:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-12-02 14:09:48,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-12-02 14:09:48,721 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-12-02 14:09:48,722 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining)
[2024-12-02 14:09:48,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining)
[2024-12-02 14:09:48,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining)
[2024-12-02 14:09:48,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining)
[2024-12-02 14:09:48,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining)
[2024-12-02 14:09:48,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining)
[2024-12-02 14:09:48,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-12-02 14:09:48,725 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 14:09:48,774 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-12-02 14:09:48,774 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-12-02 14:09:48,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:09:48 BasicIcfg
[2024-12-02 14:09:48,779 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-12-02 14:09:48,780 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-12-02 14:09:48,780 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-12-02 14:09:48,780 INFO L274 PluginConnector]: Witness Printer initialized
[2024-12-02 14:09:48,780 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:09:43" (3/4) ...
[2024-12-02 14:09:48,782 INFO L149 WitnessPrinter]: No result that supports witness generation found
[2024-12-02 14:09:48,783 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-12-02 14:09:48,784 INFO L158 Benchmark]: Toolchain (without parser) took 6258.74ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 115.6MB in the beginning and 196.5MB in the end (delta: -80.8MB). Peak memory consumption was 142.4MB. Max. memory is 16.1GB.
[2024-12-02 14:09:48,784 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 142.6MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 14:09:48,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.01ms. Allocated memory is still 142.6MB. Free memory was 115.5MB in the beginning and 92.8MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-12-02 14:09:48,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.63ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 90.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 14:09:48,784 INFO L158 Benchmark]: Boogie Preprocessor took 41.06ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 87.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 14:09:48,785 INFO L158 Benchmark]: RCFGBuilder took 546.08ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 102.7MB in the end (delta: -15.0MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB.
[2024-12-02 14:09:48,785 INFO L158 Benchmark]: TraceAbstraction took 5246.65ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 102.1MB in the beginning and 196.5MB in the end (delta: -94.4MB). Peak memory consumption was 128.5MB. Max. memory is 16.1GB.
[2024-12-02 14:09:48,785 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 369.1MB. Free memory was 196.5MB in the beginning and 196.5MB in the end (delta: 30.8kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 14:09:48,787 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.36ms. Allocated memory is still 142.6MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 378.01ms. Allocated memory is still 142.6MB. Free memory was 115.5MB in the beginning and 92.8MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 38.63ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 90.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 41.06ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 87.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 546.08ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 102.7MB in the end (delta: -15.0MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB.
* TraceAbstraction took 5246.65ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 102.1MB in the beginning and 196.5MB in the end (delta: -94.4MB). Peak memory consumption was 128.5MB. Max. memory is 16.1GB.
* Witness Printer took 2.93ms. Allocated memory is still 369.1MB. Free memory was 196.5MB in the beginning and 196.5MB in the end (delta: 30.8kB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 17.
Possible FailurePath:
[L708] 0 int __unbuffered_cnt = 0;
[L710] 0 int __unbuffered_p0_EAX = 0;
[L712] 0 int __unbuffered_p0_EBX = 0;
[L714] 0 int __unbuffered_p1_EAX = 0;
[L716] 0 int __unbuffered_p1_EBX = 0;
[L718] 0 int a = 0;
[L719] 0 _Bool a$flush_delayed;
[L720] 0 int a$mem_tmp;
[L721] 0 _Bool a$r_buff0_thd0;
[L722] 0 _Bool a$r_buff0_thd1;
[L723] 0 _Bool a$r_buff0_thd2;
[L724] 0 _Bool a$r_buff1_thd0;
[L725] 0 _Bool a$r_buff1_thd1;
[L726] 0 _Bool a$r_buff1_thd2;
[L727] 0 _Bool a$read_delayed;
[L728] 0 int *a$read_delayed_var;
[L729] 0 int a$w_buff0;
[L730] 0 _Bool a$w_buff0_used;
[L731] 0 int a$w_buff1;
[L732] 0 _Bool a$w_buff1_used;
[L733] 0 _Bool main$tmp_guard0;
[L734] 0 _Bool main$tmp_guard1;
[L736] 0 int x = 0;
[L738] 0 int y = 0;
[L740] 0 int z = 0;
[L741] 0 _Bool weak$$choice0;
[L742] 0 _Bool weak$$choice2;
[L827] 0 pthread_t t833;
[L828] FCALL, FORK 0 pthread_create(&t833, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t833=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L829] 0 pthread_t t834;
[L830] FCALL, FORK 0 pthread_create(&t834, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t833=-2, t834=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L746] 1 a$w_buff1 = a$w_buff0
[L747] 1 a$w_buff0 = 1
[L748] 1 a$w_buff1_used = a$w_buff0_used
[L749] 1 a$w_buff0_used = (_Bool)1
[L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used))
[L18] COND FALSE 1 !(!expression)
[L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used))
[L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0
[L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1
[L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2
[L754] 1 a$r_buff0_thd1 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L757] 1 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L760] 1 __unbuffered_p0_EAX = x
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L763] 1 __unbuffered_p0_EBX = y
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L780] 2 y = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0]
[L783] 2 z = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L786] 2 __unbuffered_p1_EAX = z
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L789] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L790] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L791] 2 a$flush_delayed = weak$$choice2
[L792] 2 a$mem_tmp = a
[L793] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)
[L794] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))
[L795] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))
[L796] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))
[L797] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L798] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2))
[L799] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L800] 2 __unbuffered_p1_EBX = a
[L801] 2 a = a$flush_delayed ? a$mem_tmp : a
[L802] 2 a$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L805] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)
[L806] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used
[L807] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used
[L808] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2
[L809] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a)
[L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used
[L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used
[L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1
[L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L832] 0 main$tmp_guard0 = __unbuffered_cnt == 2
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833=-2, t834=-1, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L834] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L834] RET 0 assume_abort_if_not(main$tmp_guard0)
[L836] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a)
[L837] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used
[L838] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used
[L839] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0
[L840] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833=-2, t834=-1, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0)
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833=-2, t834=-1, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L845] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
[L18] CALL 0 reach_error()
[L17] COND FALSE 0 !(0)
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L17] 0 __assert_fail ("0", "mix031.oepc.c", 8, __extension__ __PRETTY_FUNCTION__)
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 825]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 828]: 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: 830]: 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, 59 locations, 6 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.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 279 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 258 mSDsluCounter, 134 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 111 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 902 IncrementalHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 23 mSDtfsCounter, 902 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272occurred in iteration=9, InterpolantAutomatonStates: 57, 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.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 1055 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-12-02 14:09:48,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1 --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 c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-d790fec
[2024-12-02 14:09:50,733 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-12-02 14:09:50,808 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2024-12-02 14:09:50,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-12-02 14:09:50,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-12-02 14:09:50,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-12-02 14:09:50,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-12-02 14:09:50,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-12-02 14:09:50,838 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-12-02 14:09:50,838 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-12-02 14:09:50,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-12-02 14:09:50,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-12-02 14:09:50,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-12-02 14:09:50,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-12-02 14:09:50,838 INFO L153 SettingsManager]: * Use SBE=true
[2024-12-02 14:09:50,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-12-02 14:09:50,839 INFO L153 SettingsManager]: * sizeof long=4
[2024-12-02 14:09:50,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-12-02 14:09:50,839 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-12-02 14:09:50,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-12-02 14:09:50,839 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-12-02 14:09:50,839 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-12-02 14:09:50,839 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-12-02 14:09:50,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-12-02 14:09:50,839 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-12-02 14:09:50,839 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-12-02 14:09:50,840 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-12-02 14:09:50,840 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-12-02 14:09:50,840 INFO L153 SettingsManager]: * sizeof long double=12
[2024-12-02 14:09:50,840 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-12-02 14:09:50,840 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-12-02 14:09:50,840 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-12-02 14:09:50,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-12-02 14:09:50,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-12-02 14:09:50,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-12-02 14:09:50,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 14:09:50,840 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-12-02 14:09:50,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-12-02 14:09:50,841 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-12-02 14:09:50,841 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-12-02 14:09:50,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 14:09:50,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-12-02 14:09:50,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-12-02 14:09:50,841 INFO L153 SettingsManager]: * Trace refinement strategy=FOX
[2024-12-02 14:09:50,841 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-12-02 14:09:50,841 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-12-02 14:09:50,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-12-02 14:09:50,841 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-12-02 14:09:50,841 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-12-02 14:09:50,841 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_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1
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 -> c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf
[2024-12-02 14:09:51,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-12-02 14:09:51,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-12-02 14:09:51,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-12-02 14:09:51,090 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-12-02 14:09:51,090 INFO L274 PluginConnector]: CDTParser initialized
[2024-12-02 14:09:51,092 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-wmm/mix031.oepc.i
[2024-12-02 14:09:53,795 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/data/0e91f3b27/a8ed6198110e4ab3b72156201f6600bc/FLAGb32949bdd
[2024-12-02 14:09:54,016 INFO L384 CDTParser]: Found 1 translation units.
[2024-12-02 14:09:54,016 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/sv-benchmarks/c/pthread-wmm/mix031.oepc.i
[2024-12-02 14:09:54,028 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/data/0e91f3b27/a8ed6198110e4ab3b72156201f6600bc/FLAGb32949bdd
[2024-12-02 14:09:54,041 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/data/0e91f3b27/a8ed6198110e4ab3b72156201f6600bc
[2024-12-02 14:09:54,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-12-02 14:09:54,044 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-12-02 14:09:54,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-12-02 14:09:54,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-12-02 14:09:54,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-12-02 14:09:54,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:09:54" (1/1) ...
[2024-12-02 14:09:54,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@706eb847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:54, skipping insertion in model container
[2024-12-02 14:09:54,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:09:54" (1/1) ...
[2024-12-02 14:09:54,075 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-12-02 14:09:54,334 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-12-02 14:09:54,343 INFO L200 MainTranslator]: Completed pre-run
[2024-12-02 14:09:54,394 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-12-02 14:09:54,426 INFO L204 MainTranslator]: Completed translation
[2024-12-02 14:09:54,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:54 WrapperNode
[2024-12-02 14:09:54,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-12-02 14:09:54,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-12-02 14:09:54,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-12-02 14:09:54,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-12-02 14:09:54,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:54" (1/1) ...
[2024-12-02 14:09:54,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:54" (1/1) ...
[2024-12-02 14:09:54,461 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 119
[2024-12-02 14:09:54,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-12-02 14:09:54,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-12-02 14:09:54,462 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-12-02 14:09:54,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-12-02 14:09:54,470 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:54" (1/1) ...
[2024-12-02 14:09:54,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:54" (1/1) ...
[2024-12-02 14:09:54,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:54" (1/1) ...
[2024-12-02 14:09:54,488 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-12-02 14:09:54,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:54" (1/1) ...
[2024-12-02 14:09:54,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:54" (1/1) ...
[2024-12-02 14:09:54,496 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:54" (1/1) ...
[2024-12-02 14:09:54,497 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:54" (1/1) ...
[2024-12-02 14:09:54,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:54" (1/1) ...
[2024-12-02 14:09:54,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:54" (1/1) ...
[2024-12-02 14:09:54,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:54" (1/1) ...
[2024-12-02 14:09:54,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-12-02 14:09:54,505 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-12-02 14:09:54,506 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-12-02 14:09:54,506 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-12-02 14:09:54,507 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:54" (1/1) ...
[2024-12-02 14:09:54,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 14:09:54,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3
[2024-12-02 14:09:54,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-12-02 14:09:54,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-12-02 14:09:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-12-02 14:09:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-12-02 14:09:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-12-02 14:09:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-12-02 14:09:54,558 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-12-02 14:09:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-12-02 14:09:54,558 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-12-02 14:09:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-12-02 14:09:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-12-02 14:09:54,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-12-02 14:09:54,559 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-12-02 14:09:54,664 INFO L234 CfgBuilder]: Building ICFG
[2024-12-02 14:09:54,665 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-12-02 14:09:54,913 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-12-02 14:09:54,913 INFO L283 CfgBuilder]: Performing block encoding
[2024-12-02 14:09:55,101 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-12-02 14:09:55,101 INFO L312 CfgBuilder]: Removed 0 assume(true) statements.
[2024-12-02 14:09:55,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:09:55 BoogieIcfgContainer
[2024-12-02 14:09:55,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-12-02 14:09:55,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-12-02 14:09:55,104 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-12-02 14:09:55,109 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-12-02 14:09:55,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:09:54" (1/3) ...
[2024-12-02 14:09:55,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a809b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:09:55, skipping insertion in model container
[2024-12-02 14:09:55,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:54" (2/3) ...
[2024-12-02 14:09:55,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a809b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:09:55, skipping insertion in model container
[2024-12-02 14:09:55,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:09:55" (3/3) ...
[2024-12-02 14:09:55,111 INFO L128 eAbstractionObserver]: Analyzing ICFG mix031.oepc.i
[2024-12-02 14:09:55,125 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-12-02 14:09:55,127 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix031.oepc.i that has 3 procedures, 38 locations, 1 initial locations, 0 loop locations, and 3 error locations.
[2024-12-02 14:09:55,127 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-12-02 14:09:55,179 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-12-02 14:09:55,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 86 flow
[2024-12-02 14:09:55,242 INFO L124 PetriNetUnfolderBase]: 2/37 cut-off events.
[2024-12-02 14:09:55,244 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-02 14:09:55,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 37 events. 2/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place.
[2024-12-02 14:09:55,247 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 86 flow
[2024-12-02 14:09:55,250 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 37 transitions, 80 flow
[2024-12-02 14:09:55,257 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-12-02 14:09:55,268 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;@6991acf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-12-02 14:09:55,268 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-12-02 14:09:55,282 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-12-02 14:09:55,282 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-12-02 14:09:55,282 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-02 14:09:55,282 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 14:09:55,283 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-12-02 14:09:55,283 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 14:09:55,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 14:09:55,288 INFO L85 PathProgramCache]: Analyzing trace with hash 11193878, now seen corresponding path program 1 times
[2024-12-02 14:09:55,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-12-02 14:09:55,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2119332739]
[2024-12-02 14:09:55,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 14:09:55,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 14:09:55,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3
[2024-12-02 14:09:55,301 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-12-02 14:09:55,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-12-02 14:09:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 14:09:55,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-12-02 14:09:55,401 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-12-02 14:09:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 14:09:55,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-12-02 14:09:55,431 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-12-02 14:09:55,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119332739]
[2024-12-02 14:09:55,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119332739] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 14:09:55,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 14:09:55,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-12-02 14:09:55,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108790864]
[2024-12-02 14:09:55,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 14:09:55,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 14:09:55,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-12-02 14:09:55,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 14:09:55,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 14:09:55,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 39
[2024-12-02 14:09:55,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-12-02 14:09:55,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 14:09:55,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 39
[2024-12-02 14:09:55,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 14:09:55,652 INFO L124 PetriNetUnfolderBase]: 183/411 cut-off events.
[2024-12-02 14:09:55,652 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2024-12-02 14:09:55,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 411 events. 183/411 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2113 event pairs, 69 based on Foata normal form. 32/438 useless extension candidates. Maximal degree in co-relation 735. Up to 265 conditions per place.
[2024-12-02 14:09:55,657 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 25 selfloop transitions, 2 changer transitions 2/45 dead transitions.
[2024-12-02 14:09:55,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 157 flow
[2024-12-02 14:09:55,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 14:09:55,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 14:09:55,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions.
[2024-12-02 14:09:55,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521367521367521
[2024-12-02 14:09:55,668 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 80 flow. Second operand 3 states and 88 transitions.
[2024-12-02 14:09:55,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 157 flow
[2024-12-02 14:09:55,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 14:09:55,674 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 72 flow
[2024-12-02 14:09:55,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=32}
[2024-12-02 14:09:55,678 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places.
[2024-12-02 14:09:55,678 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 72 flow
[2024-12-02 14:09:55,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-12-02 14:09:55,679 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 14:09:55,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 14:09:55,686 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-12-02 14:09:55,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 14:09:55,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 14:09:55,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 14:09:55,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1097371514, now seen corresponding path program 1 times
[2024-12-02 14:09:55,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-12-02 14:09:55,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1742430194]
[2024-12-02 14:09:55,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 14:09:55,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 14:09:55,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3
[2024-12-02 14:09:55,883 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-12-02 14:09:55,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-12-02 14:09:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 14:09:55,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-12-02 14:09:55,966 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-12-02 14:09:55,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 14:09:55,991 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-12-02 14:09:55,991 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-12-02 14:09:55,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742430194]
[2024-12-02 14:09:55,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742430194] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 14:09:55,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 14:09:55,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-12-02 14:09:55,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329657067]
[2024-12-02 14:09:55,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 14:09:55,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 14:09:55,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-12-02 14:09:55,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 14:09:55,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 14:09:55,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 39
[2024-12-02 14:09:55,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-12-02 14:09:55,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 14:09:55,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 39
[2024-12-02 14:09:55,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 14:09:56,108 INFO L124 PetriNetUnfolderBase]: 159/381 cut-off events.
[2024-12-02 14:09:56,108 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES.
[2024-12-02 14:09:56,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 381 events. 159/381 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2108 event pairs, 159 based on Foata normal form. 16/380 useless extension candidates. Maximal degree in co-relation 695. Up to 280 conditions per place.
[2024-12-02 14:09:56,112 INFO L140 encePairwiseOnDemand]: 37/39 looper letters, 14 selfloop transitions, 1 changer transitions 1/31 dead transitions.
[2024-12-02 14:09:56,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 102 flow
[2024-12-02 14:09:56,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 14:09:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 14:09:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions.
[2024-12-02 14:09:56,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5811965811965812
[2024-12-02 14:09:56,114 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 72 flow. Second operand 3 states and 68 transitions.
[2024-12-02 14:09:56,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 102 flow
[2024-12-02 14:09:56,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 98 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 14:09:56,115 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 66 flow
[2024-12-02 14:09:56,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, 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=66, PETRI_PLACES=38, PETRI_TRANSITIONS=30}
[2024-12-02 14:09:56,116 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places.
[2024-12-02 14:09:56,116 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 66 flow
[2024-12-02 14:09:56,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-12-02 14:09:56,117 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 14:09:56,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 14:09:56,126 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-12-02 14:09:56,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 14:09:56,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 14:09:56,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 14:09:56,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1097372943, now seen corresponding path program 1 times
[2024-12-02 14:09:56,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-12-02 14:09:56,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2108334648]
[2024-12-02 14:09:56,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 14:09:56,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 14:09:56,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3
[2024-12-02 14:09:56,320 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-12-02 14:09:56,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-12-02 14:09:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 14:09:56,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-12-02 14:09:56,399 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-12-02 14:09:56,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 14:09:56,437 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-12-02 14:09:56,437 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-12-02 14:09:56,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108334648]
[2024-12-02 14:09:56,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108334648] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 14:09:56,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 14:09:56,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-12-02 14:09:56,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229409309]
[2024-12-02 14:09:56,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 14:09:56,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-12-02 14:09:56,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-12-02 14:09:56,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-12-02 14:09:56,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-12-02 14:09:56,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39
[2024-12-02 14:09:56,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-12-02 14:09:56,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 14:09:56,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39
[2024-12-02 14:09:56,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 14:09:56,615 INFO L124 PetriNetUnfolderBase]: 198/444 cut-off events.
[2024-12-02 14:09:56,615 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-02 14:09:56,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 444 events. 198/444 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2192 event pairs, 38 based on Foata normal form. 25/455 useless extension candidates. Maximal degree in co-relation 818. Up to 191 conditions per place.
[2024-12-02 14:09:56,619 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 31 selfloop transitions, 4 changer transitions 1/48 dead transitions.
[2024-12-02 14:09:56,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 176 flow
[2024-12-02 14:09:56,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-12-02 14:09:56,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-12-02 14:09:56,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions.
[2024-12-02 14:09:56,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282
[2024-12-02 14:09:56,621 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 66 flow. Second operand 4 states and 98 transitions.
[2024-12-02 14:09:56,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 176 flow
[2024-12-02 14:09:56,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 175 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-12-02 14:09:56,623 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 91 flow
[2024-12-02 14:09:56,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=41, PETRI_TRANSITIONS=32}
[2024-12-02 14:09:56,624 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places.
[2024-12-02 14:09:56,624 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 91 flow
[2024-12-02 14:09:56,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-12-02 14:09:56,624 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 14:09:56,624 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]
[2024-12-02 14:09:56,633 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-12-02 14:09:56,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 14:09:56,825 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 14:09:56,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 14:09:56,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2002256625, now seen corresponding path program 1 times
[2024-12-02 14:09:56,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-12-02 14:09:56,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [719306292]
[2024-12-02 14:09:56,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 14:09:56,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 14:09:56,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3
[2024-12-02 14:09:56,828 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-12-02 14:09:56,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-12-02 14:09:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 14:09:56,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-12-02 14:09:56,911 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-12-02 14:09:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 14:09:56,963 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-12-02 14:09:56,963 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-12-02 14:09:56,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719306292]
[2024-12-02 14:09:56,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719306292] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 14:09:56,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 14:09:56,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-12-02 14:09:56,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2595574]
[2024-12-02 14:09:56,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 14:09:56,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-12-02 14:09:56,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-12-02 14:09:56,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-12-02 14:09:56,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-12-02 14:09:56,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39
[2024-12-02 14:09:56,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-12-02 14:09:56,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 14:09:56,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39
[2024-12-02 14:09:56,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 14:09:57,097 INFO L124 PetriNetUnfolderBase]: 102/231 cut-off events.
[2024-12-02 14:09:57,097 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES.
[2024-12-02 14:09:57,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 231 events. 102/231 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 804 event pairs, 26 based on Foata normal form. 16/236 useless extension candidates. Maximal degree in co-relation 520. Up to 86 conditions per place.
[2024-12-02 14:09:57,099 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 26 selfloop transitions, 6 changer transitions 1/45 dead transitions.
[2024-12-02 14:09:57,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 188 flow
[2024-12-02 14:09:57,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-12-02 14:09:57,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-12-02 14:09:57,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions.
[2024-12-02 14:09:57,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641
[2024-12-02 14:09:57,101 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 91 flow. Second operand 5 states and 110 transitions.
[2024-12-02 14:09:57,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 188 flow
[2024-12-02 14:09:57,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 179 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-12-02 14:09:57,102 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 107 flow
[2024-12-02 14:09:57,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=45, PETRI_TRANSITIONS=32}
[2024-12-02 14:09:57,103 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places.
[2024-12-02 14:09:57,103 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 107 flow
[2024-12-02 14:09:57,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-12-02 14:09:57,104 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 14:09:57,104 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, 1, 1, 1, 1]
[2024-12-02 14:09:57,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2024-12-02 14:09:57,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 14:09:57,304 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 14:09:57,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 14:09:57,305 INFO L85 PathProgramCache]: Analyzing trace with hash 82862628, now seen corresponding path program 1 times
[2024-12-02 14:09:57,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-12-02 14:09:57,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1403384869]
[2024-12-02 14:09:57,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 14:09:57,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 14:09:57,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3
[2024-12-02 14:09:57,307 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-12-02 14:09:57,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-12-02 14:09:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 14:09:57,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-12-02 14:09:57,391 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-12-02 14:09:57,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 14:09:57,701 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-12-02 14:09:57,701 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-12-02 14:09:57,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403384869]
[2024-12-02 14:09:57,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403384869] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 14:09:57,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 14:09:57,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-12-02 14:09:57,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382431790]
[2024-12-02 14:09:57,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 14:09:57,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-12-02 14:09:57,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-12-02 14:09:57,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-12-02 14:09:57,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-12-02 14:09:57,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39
[2024-12-02 14:09:57,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 107 flow. Second operand has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 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-12-02 14:09:57,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 14:09:57,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39
[2024-12-02 14:09:57,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 14:09:58,014 INFO L124 PetriNetUnfolderBase]: 99/253 cut-off events.
[2024-12-02 14:09:58,015 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES.
[2024-12-02 14:09:58,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 253 events. 99/253 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 916 event pairs, 19 based on Foata normal form. 4/251 useless extension candidates. Maximal degree in co-relation 573. Up to 59 conditions per place.
[2024-12-02 14:09:58,016 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 23 selfloop transitions, 4 changer transitions 20/62 dead transitions.
[2024-12-02 14:09:58,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 62 transitions, 275 flow
[2024-12-02 14:09:58,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-12-02 14:09:58,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-12-02 14:09:58,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 208 transitions.
[2024-12-02 14:09:58,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333
[2024-12-02 14:09:58,020 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 107 flow. Second operand 10 states and 208 transitions.
[2024-12-02 14:09:58,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 62 transitions, 275 flow
[2024-12-02 14:09:58,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 238 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-12-02 14:09:58,023 INFO L231 Difference]: Finished difference. Result has 53 places, 32 transitions, 99 flow
[2024-12-02 14:09:58,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=99, PETRI_PLACES=53, PETRI_TRANSITIONS=32}
[2024-12-02 14:09:58,023 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places.
[2024-12-02 14:09:58,023 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 32 transitions, 99 flow
[2024-12-02 14:09:58,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 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-12-02 14:09:58,024 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 14:09:58,024 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, 1, 1, 1, 1]
[2024-12-02 14:09:58,033 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-12-02 14:09:58,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 14:09:58,224 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 14:09:58,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 14:09:58,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1395609778, now seen corresponding path program 2 times
[2024-12-02 14:09:58,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-12-02 14:09:58,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1405366778]
[2024-12-02 14:09:58,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-12-02 14:09:58,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 14:09:58,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3
[2024-12-02 14:09:58,227 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-12-02 14:09:58,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-12-02 14:09:58,302 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-12-02 14:09:58,303 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-12-02 14:09:58,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-12-02 14:09:58,306 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-12-02 14:09:58,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 14:09:58,441 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-12-02 14:09:58,441 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-12-02 14:09:58,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405366778]
[2024-12-02 14:09:58,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405366778] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 14:09:58,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 14:09:58,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-12-02 14:09:58,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401885417]
[2024-12-02 14:09:58,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 14:09:58,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-12-02 14:09:58,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-12-02 14:09:58,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-12-02 14:09:58,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-12-02 14:09:58,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39
[2024-12-02 14:09:58,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 32 transitions, 99 flow. Second operand has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 9 states have internal predecessors, (127), 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-12-02 14:09:58,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 14:09:58,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39
[2024-12-02 14:09:58,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 14:09:58,718 INFO L124 PetriNetUnfolderBase]: 169/376 cut-off events.
[2024-12-02 14:09:58,718 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES.
[2024-12-02 14:09:58,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 376 events. 169/376 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1420 event pairs, 43 based on Foata normal form. 4/377 useless extension candidates. Maximal degree in co-relation 860. Up to 145 conditions per place.
[2024-12-02 14:09:58,720 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 26 selfloop transitions, 4 changer transitions 30/69 dead transitions.
[2024-12-02 14:09:58,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 69 transitions, 333 flow
[2024-12-02 14:09:58,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-12-02 14:09:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-12-02 14:09:58,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions.
[2024-12-02 14:09:58,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145
[2024-12-02 14:09:58,722 INFO L175 Difference]: Start difference. First operand has 53 places, 32 transitions, 99 flow. Second operand 9 states and 169 transitions.
[2024-12-02 14:09:58,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 69 transitions, 333 flow
[2024-12-02 14:09:58,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 297 flow, removed 7 selfloop flow, removed 8 redundant places.
[2024-12-02 14:09:58,724 INFO L231 Difference]: Finished difference. Result has 53 places, 32 transitions, 104 flow
[2024-12-02 14:09:58,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=104, PETRI_PLACES=53, PETRI_TRANSITIONS=32}
[2024-12-02 14:09:58,725 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places.
[2024-12-02 14:09:58,725 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 32 transitions, 104 flow
[2024-12-02 14:09:58,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 9 states have internal predecessors, (127), 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-12-02 14:09:58,725 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 14:09:58,725 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, 1, 1, 1, 1]
[2024-12-02 14:09:58,734 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-12-02 14:09:58,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 14:09:58,926 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-12-02 14:09:58,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 14:09:58,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2017066950, now seen corresponding path program 3 times
[2024-12-02 14:09:58,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-12-02 14:09:58,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [565617283]
[2024-12-02 14:09:58,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-12-02 14:09:58,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 14:09:58,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3
[2024-12-02 14:09:58,929 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-12-02 14:09:58,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-12-02 14:09:59,004 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-12-02 14:09:59,004 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat
[2024-12-02 14:09:59,004 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-12-02 14:09:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-12-02 14:09:59,072 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace
[2024-12-02 14:09:59,072 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-12-02 14:09:59,073 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining)
[2024-12-02 14:09:59,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining)
[2024-12-02 14:09:59,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining)
[2024-12-02 14:09:59,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining)
[2024-12-02 14:09:59,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining)
[2024-12-02 14:09:59,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining)
[2024-12-02 14:09:59,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-12-02 14:09:59,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-02 14:09:59,276 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1]
[2024-12-02 14:09:59,326 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-12-02 14:09:59,326 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-12-02 14:09:59,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:09:59 BasicIcfg
[2024-12-02 14:09:59,332 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-12-02 14:09:59,332 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-12-02 14:09:59,332 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-12-02 14:09:59,332 INFO L274 PluginConnector]: Witness Printer initialized
[2024-12-02 14:09:59,333 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:09:55" (3/4) ...
[2024-12-02 14:09:59,334 INFO L149 WitnessPrinter]: No result that supports witness generation found
[2024-12-02 14:09:59,335 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-12-02 14:09:59,336 INFO L158 Benchmark]: Toolchain (without parser) took 5292.06ms. Allocated memory was 92.3MB in the beginning and 142.6MB in the end (delta: 50.3MB). Free memory was 68.5MB in the beginning and 65.9MB in the end (delta: 2.6MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB.
[2024-12-02 14:09:59,336 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 14:09:59,337 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.78ms. Allocated memory is still 92.3MB. Free memory was 68.4MB in the beginning and 45.5MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-12-02 14:09:59,337 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.80ms. Allocated memory is still 92.3MB. Free memory was 45.5MB in the beginning and 43.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 14:09:59,337 INFO L158 Benchmark]: Boogie Preprocessor took 42.62ms. Allocated memory is still 92.3MB. Free memory was 43.3MB in the beginning and 40.6MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 14:09:59,337 INFO L158 Benchmark]: RCFGBuilder took 596.46ms. Allocated memory is still 92.3MB. Free memory was 40.6MB in the beginning and 42.5MB in the end (delta: -1.9MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB.
[2024-12-02 14:09:59,337 INFO L158 Benchmark]: TraceAbstraction took 4227.71ms. Allocated memory was 92.3MB in the beginning and 142.6MB in the end (delta: 50.3MB). Free memory was 42.0MB in the beginning and 66.0MB in the end (delta: -23.9MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB.
[2024-12-02 14:09:59,338 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 142.6MB. Free memory was 66.0MB in the beginning and 65.9MB in the end (delta: 17.6kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 14:09:59,339 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.39ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 381.78ms. Allocated memory is still 92.3MB. Free memory was 68.4MB in the beginning and 45.5MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 34.80ms. Allocated memory is still 92.3MB. Free memory was 45.5MB in the beginning and 43.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 42.62ms. Allocated memory is still 92.3MB. Free memory was 43.3MB in the beginning and 40.6MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 596.46ms. Allocated memory is still 92.3MB. Free memory was 40.6MB in the beginning and 42.5MB in the end (delta: -1.9MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB.
* TraceAbstraction took 4227.71ms. Allocated memory was 92.3MB in the beginning and 142.6MB in the end (delta: 50.3MB). Free memory was 42.0MB in the beginning and 66.0MB in the end (delta: -23.9MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB.
* Witness Printer took 3.10ms. Allocated memory is still 142.6MB. Free memory was 66.0MB in the beginning and 65.9MB in the end (delta: 17.6kB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 17.
Possible FailurePath:
[L708] 0 int __unbuffered_cnt = 0;
[L710] 0 int __unbuffered_p0_EAX = 0;
[L712] 0 int __unbuffered_p0_EBX = 0;
[L714] 0 int __unbuffered_p1_EAX = 0;
[L716] 0 int __unbuffered_p1_EBX = 0;
[L718] 0 int a = 0;
[L719] 0 _Bool a$flush_delayed;
[L720] 0 int a$mem_tmp;
[L721] 0 _Bool a$r_buff0_thd0;
[L722] 0 _Bool a$r_buff0_thd1;
[L723] 0 _Bool a$r_buff0_thd2;
[L724] 0 _Bool a$r_buff1_thd0;
[L725] 0 _Bool a$r_buff1_thd1;
[L726] 0 _Bool a$r_buff1_thd2;
[L727] 0 _Bool a$read_delayed;
[L728] 0 int *a$read_delayed_var;
[L729] 0 int a$w_buff0;
[L730] 0 _Bool a$w_buff0_used;
[L731] 0 int a$w_buff1;
[L732] 0 _Bool a$w_buff1_used;
[L733] 0 _Bool main$tmp_guard0;
[L734] 0 _Bool main$tmp_guard1;
[L736] 0 int x = 0;
[L738] 0 int y = 0;
[L740] 0 int z = 0;
[L741] 0 _Bool weak$$choice0;
[L742] 0 _Bool weak$$choice2;
[L827] 0 pthread_t t833;
[L828] FCALL, FORK 0 pthread_create(&t833, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t833=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L746] 1 a$w_buff1 = a$w_buff0
[L747] 1 a$w_buff0 = 1
[L748] 1 a$w_buff1_used = a$w_buff0_used
[L749] 1 a$w_buff0_used = (_Bool)1
[L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used))
[L18] COND FALSE 1 !(!expression)
[L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used))
[L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0
[L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1
[L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2
[L754] 1 a$r_buff0_thd1 = (_Bool)1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L757] 1 x = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L760] 1 __unbuffered_p0_EAX = x
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L763] 1 __unbuffered_p0_EBX = y
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L829] 0 pthread_t t834;
[L830] FCALL, FORK 0 pthread_create(&t834, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t833=0, t834=1, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L780] 2 y = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0]
[L783] 2 z = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L786] 2 __unbuffered_p1_EAX = z
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L789] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L790] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L791] 2 a$flush_delayed = weak$$choice2
[L792] 2 a$mem_tmp = a
[L793] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)
[L794] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))
[L795] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))
[L796] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))
[L797] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L798] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2))
[L799] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L800] 2 __unbuffered_p1_EBX = a
[L801] 2 a = a$flush_delayed ? a$mem_tmp : a
[L802] 2 a$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1]
[L805] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)
[L806] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used
[L807] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used
[L808] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2
[L809] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1]
[L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a)
[L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used
[L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used
[L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1
[L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1]
[L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1]
[L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1]
[L832] 0 main$tmp_guard0 = __unbuffered_cnt == 2
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833=0, t834=1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1]
[L834] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L834] RET 0 assume_abort_if_not(main$tmp_guard0)
[L836] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a)
[L837] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used
[L838] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used
[L839] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0
[L840] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833=0, t834=1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1]
[L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0)
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833=0, t834=1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1]
[L845] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
[L18] CALL 0 reach_error()
[L17] COND FALSE 0 !(0)
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1]
[L17] 0 __assert_fail ("0", "mix031.oepc.c", 8, __extension__ __PRETTY_FUNCTION__)
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1]
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 825]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 828]: 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: 830]: 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, 59 locations, 6 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: 4.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 614 IncrementalHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 10 mSDtfsCounter, 614 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=4, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 448 SizeOfPredicates, 15 NumberOfNonLiveVariables, 517 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-12-02 14:09:59,357 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bc294c-9f73-49ac-9e6c-9241f34c174b/bin/uautomizer-verify-84ZbGMXZE1/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