./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3bbcbfea07b4de27a61735028fd08097276598be4815bd7ea5f14ba44ebf2380 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:16:45,835 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:16:45,979 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-27 20:16:45,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:16:45,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:16:46,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:16:46,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:16:46,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:16:46,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:16:46,045 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:16:46,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:16:46,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:16:46,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:16:46,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:16:46,047 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:16:46,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:16:46,048 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:16:46,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:16:46,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:16:46,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:16:46,048 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 20:16:46,048 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 20:16:46,049 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 20:16:46,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:16:46,049 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:16:46,049 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:16:46,049 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:16:46,049 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:16:46,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:16:46,050 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:16:46,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:16:46,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:16:46,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:16:46,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:16:46,050 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:16:46,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:16:46,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:16:46,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:16:46,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:16:46,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:16:46,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:16:46,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:16:46,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:16:46,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:16:46,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:16:46,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:16:46,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:16:46,053 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_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3bbcbfea07b4de27a61735028fd08097276598be4815bd7ea5f14ba44ebf2380 [2024-11-27 20:16:46,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:16:46,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:16:46,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:16:46,499 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:16:46,499 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:16:46,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i [2024-11-27 20:16:50,675 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/data/937cca216/c13e1d2c67a542449c920e917200d403/FLAGb1b9c1494 [2024-11-27 20:16:51,272 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:16:51,275 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i [2024-11-27 20:16:51,304 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/data/937cca216/c13e1d2c67a542449c920e917200d403/FLAGb1b9c1494 [2024-11-27 20:16:51,779 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/data/937cca216/c13e1d2c67a542449c920e917200d403 [2024-11-27 20:16:51,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:16:51,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:16:51,786 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:16:51,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:16:51,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:16:51,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:16:51" (1/1) ... [2024-11-27 20:16:51,796 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c167ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:51, skipping insertion in model container [2024-11-27 20:16:51,796 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:16:51" (1/1) ... [2024-11-27 20:16:51,836 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:16:52,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:16:52,396 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:16:52,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:16:52,526 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:16:52,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:52 WrapperNode [2024-11-27 20:16:52,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:16:52,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:16:52,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:16:52,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:16:52,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:52" (1/1) ... [2024-11-27 20:16:52,566 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:52" (1/1) ... [2024-11-27 20:16:52,609 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 120 [2024-11-27 20:16:52,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:16:52,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:16:52,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:16:52,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:16:52,625 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:52" (1/1) ... [2024-11-27 20:16:52,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:52" (1/1) ... [2024-11-27 20:16:52,629 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:52" (1/1) ... [2024-11-27 20:16:52,649 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-11-27 20:16:52,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:52" (1/1) ... [2024-11-27 20:16:52,650 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:52" (1/1) ... [2024-11-27 20:16:52,659 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:52" (1/1) ... [2024-11-27 20:16:52,661 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:52" (1/1) ... [2024-11-27 20:16:52,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:52" (1/1) ... [2024-11-27 20:16:52,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:52" (1/1) ... [2024-11-27 20:16:52,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:52" (1/1) ... [2024-11-27 20:16:52,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:16:52,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:16:52,674 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:16:52,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:16:52,675 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:52" (1/1) ... [2024-11-27 20:16:52,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:16:52,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:16:52,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:16:52,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:16:52,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-27 20:16:52,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:16:52,774 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-27 20:16:52,774 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-27 20:16:52,775 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-27 20:16:52,775 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-27 20:16:52,775 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-27 20:16:52,775 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-27 20:16:52,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 20:16:52,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-27 20:16:52,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:16:52,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:16:52,778 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-27 20:16:52,957 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:16:52,959 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:16:53,495 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-27 20:16:53,496 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:16:53,946 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:16:53,949 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 20:16:53,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:16:53 BoogieIcfgContainer [2024-11-27 20:16:53,950 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:16:53,952 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:16:53,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:16:53,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:16:53,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:16:51" (1/3) ... [2024-11-27 20:16:53,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5926c74b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:16:53, skipping insertion in model container [2024-11-27 20:16:53,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:52" (2/3) ... [2024-11-27 20:16:53,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5926c74b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:16:53, skipping insertion in model container [2024-11-27 20:16:53,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:16:53" (3/3) ... [2024-11-27 20:16:53,969 INFO L128 eAbstractionObserver]: Analyzing ICFG mix025_pso.opt_rmo.opt.i [2024-11-27 20:16:53,989 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:16:53,991 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix025_pso.opt_rmo.opt.i that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-27 20:16:53,993 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-27 20:16:54,088 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-27 20:16:54,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2024-11-27 20:16:54,214 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2024-11-27 20:16:54,219 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:16:54,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-11-27 20:16:54,227 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2024-11-27 20:16:54,235 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2024-11-27 20:16:54,250 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:16:54,273 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;@28187724, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:16:54,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-27 20:16:54,288 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 20:16:54,288 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-11-27 20:16:54,288 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:16:54,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:16:54,289 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-27 20:16:54,293 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:16:54,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:16:54,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1528644678, now seen corresponding path program 1 times [2024-11-27 20:16:54,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:16:54,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229883943] [2024-11-27 20:16:54,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:16:54,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:16:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:16:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:16:55,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:16:55,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229883943] [2024-11-27 20:16:55,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229883943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:16:55,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:16:55,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 20:16:55,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281494656] [2024-11-27 20:16:55,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:16:55,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:16:55,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:16:55,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:16:55,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:16:55,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 45 [2024-11-27 20:16:55,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:16:55,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:16:55,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 45 [2024-11-27 20:16:55,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:16:55,933 INFO L124 PetriNetUnfolderBase]: 603/1130 cut-off events. [2024-11-27 20:16:55,934 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-27 20:16:55,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2089 conditions, 1130 events. 603/1130 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6971 event pairs, 192 based on Foata normal form. 72/1183 useless extension candidates. Maximal degree in co-relation 2078. Up to 742 conditions per place. [2024-11-27 20:16:55,950 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 29 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2024-11-27 20:16:55,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 180 flow [2024-11-27 20:16:55,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:16:55,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:16:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-11-27 20:16:55,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7481481481481481 [2024-11-27 20:16:55,980 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 101 transitions. [2024-11-27 20:16:55,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 180 flow [2024-11-27 20:16:55,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 51 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-27 20:16:55,996 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2024-11-27 20:16:55,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-27 20:16:56,006 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2024-11-27 20:16:56,006 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2024-11-27 20:16:56,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:16:56,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:16:56,007 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:16:56,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 20:16:56,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:16:56,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:16:56,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1152849331, now seen corresponding path program 1 times [2024-11-27 20:16:56,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:16:56,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488442527] [2024-11-27 20:16:56,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:16:56,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:16:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:16:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:16:56,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:16:56,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488442527] [2024-11-27 20:16:56,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488442527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:16:56,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:16:56,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 20:16:56,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040589979] [2024-11-27 20:16:56,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:16:56,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:16:56,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:16:56,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:16:56,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:16:56,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-11-27 20:16:56,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:16:56,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:16:56,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-11-27 20:16:56,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:16:56,619 INFO L124 PetriNetUnfolderBase]: 528/1064 cut-off events. [2024-11-27 20:16:56,620 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-11-27 20:16:56,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1980 conditions, 1064 events. 528/1064 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6984 event pairs, 528 based on Foata normal form. 36/1054 useless extension candidates. Maximal degree in co-relation 1970. Up to 811 conditions per place. [2024-11-27 20:16:56,634 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 17 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2024-11-27 20:16:56,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 120 flow [2024-11-27 20:16:56,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:16:56,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:16:56,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-27 20:16:56,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-11-27 20:16:56,637 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 80 transitions. [2024-11-27 20:16:56,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 120 flow [2024-11-27 20:16:56,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:16:56,640 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2024-11-27 20:16:56,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-11-27 20:16:56,642 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2024-11-27 20:16:56,642 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2024-11-27 20:16:56,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:16:56,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:16:56,643 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:16:56,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:16:56,643 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:16:56,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:16:56,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1152849415, now seen corresponding path program 1 times [2024-11-27 20:16:56,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:16:56,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381956613] [2024-11-27 20:16:56,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:16:56,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:16:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:16:57,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:16:57,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:16:57,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381956613] [2024-11-27 20:16:57,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381956613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:16:57,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:16:57,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:16:57,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452170340] [2024-11-27 20:16:57,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:16:57,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:16:57,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:16:57,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:16:57,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:16:57,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-27 20:16:57,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:16:57,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:16:57,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-27 20:16:57,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:16:57,830 INFO L124 PetriNetUnfolderBase]: 1213/2145 cut-off events. [2024-11-27 20:16:57,830 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:16:57,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4041 conditions, 2145 events. 1213/2145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13555 event pairs, 147 based on Foata normal form. 80/2182 useless extension candidates. Maximal degree in co-relation 4035. Up to 1081 conditions per place. [2024-11-27 20:16:57,853 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 39 selfloop transitions, 5 changer transitions 1/58 dead transitions. [2024-11-27 20:16:57,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 218 flow [2024-11-27 20:16:57,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:16:57,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-27 20:16:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2024-11-27 20:16:57,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-11-27 20:16:57,858 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 4 states and 115 transitions. [2024-11-27 20:16:57,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 218 flow [2024-11-27 20:16:57,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 20:16:57,861 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 111 flow [2024-11-27 20:16:57,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=43, 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=4, PETRI_FLOW=111, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-11-27 20:16:57,866 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2024-11-27 20:16:57,866 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 111 flow [2024-11-27 20:16:57,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:16:57,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:16:57,867 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-11-27 20:16:57,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 20:16:57,867 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:16:57,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:16:57,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1070252880, now seen corresponding path program 1 times [2024-11-27 20:16:57,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:16:57,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554181401] [2024-11-27 20:16:57,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:16:57,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:16:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:16:58,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:16:58,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:16:58,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554181401] [2024-11-27 20:16:58,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554181401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:16:58,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:16:58,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:16:58,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924111041] [2024-11-27 20:16:58,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:16:58,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:16:58,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:16:58,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:16:58,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:16:58,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-27 20:16:58,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:16:58,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:16:58,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-27 20:16:58,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:16:58,997 INFO L124 PetriNetUnfolderBase]: 809/1441 cut-off events. [2024-11-27 20:16:58,998 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2024-11-27 20:16:59,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3248 conditions, 1441 events. 809/1441 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8017 event pairs, 73 based on Foata normal form. 68/1474 useless extension candidates. Maximal degree in co-relation 3239. Up to 521 conditions per place. [2024-11-27 20:16:59,013 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 49 selfloop transitions, 8 changer transitions 1/71 dead transitions. [2024-11-27 20:16:59,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 314 flow [2024-11-27 20:16:59,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:16:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 20:16:59,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2024-11-27 20:16:59,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2024-11-27 20:16:59,015 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 111 flow. Second operand 5 states and 145 transitions. [2024-11-27 20:16:59,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 314 flow [2024-11-27 20:16:59,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 304 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-27 20:16:59,023 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 151 flow [2024-11-27 20:16:59,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-11-27 20:16:59,025 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-11-27 20:16:59,025 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 151 flow [2024-11-27 20:16:59,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:16:59,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:16:59,027 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] [2024-11-27 20:16:59,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 20:16:59,028 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:16:59,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:16:59,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1124567925, now seen corresponding path program 1 times [2024-11-27 20:16:59,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:16:59,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485723813] [2024-11-27 20:16:59,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:16:59,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:16:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:16:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:16:59,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:16:59,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485723813] [2024-11-27 20:16:59,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485723813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:16:59,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:16:59,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:16:59,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957418450] [2024-11-27 20:16:59,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:16:59,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:16:59,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:16:59,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:16:59,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:16:59,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-27 20:16:59,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:16:59,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:16:59,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-27 20:16:59,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:17:00,034 INFO L124 PetriNetUnfolderBase]: 477/825 cut-off events. [2024-11-27 20:17:00,034 INFO L125 PetriNetUnfolderBase]: For 730/730 co-relation queries the response was YES. [2024-11-27 20:17:00,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2138 conditions, 825 events. 477/825 cut-off events. For 730/730 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3731 event pairs, 59 based on Foata normal form. 36/831 useless extension candidates. Maximal degree in co-relation 2127. Up to 268 conditions per place. [2024-11-27 20:17:00,043 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 43 selfloop transitions, 11 changer transitions 1/68 dead transitions. [2024-11-27 20:17:00,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 325 flow [2024-11-27 20:17:00,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:17:00,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 20:17:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2024-11-27 20:17:00,047 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2024-11-27 20:17:00,047 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 151 flow. Second operand 6 states and 159 transitions. [2024-11-27 20:17:00,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 325 flow [2024-11-27 20:17:00,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 300 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-27 20:17:00,060 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 165 flow [2024-11-27 20:17:00,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2024-11-27 20:17:00,062 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2024-11-27 20:17:00,063 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 165 flow [2024-11-27 20:17:00,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:00,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:17:00,064 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, 1, 1, 1, 1] [2024-11-27 20:17:00,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 20:17:00,065 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:17:00,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:00,067 INFO L85 PathProgramCache]: Analyzing trace with hash -287685668, now seen corresponding path program 1 times [2024-11-27 20:17:00,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:17:00,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597773693] [2024-11-27 20:17:00,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:17:00,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:17:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:17:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:02,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:17:02,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597773693] [2024-11-27 20:17:02,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597773693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:17:02,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:17:02,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:17:02,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665822966] [2024-11-27 20:17:02,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:17:02,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 20:17:02,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:17:02,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 20:17:02,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-27 20:17:03,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-11-27 20:17:03,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 165 flow. Second operand has 10 states, 10 states have (on average 17.1) internal successors, (171), 10 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:03,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:17:03,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-11-27 20:17:03,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:17:04,903 INFO L124 PetriNetUnfolderBase]: 1572/2772 cut-off events. [2024-11-27 20:17:04,904 INFO L125 PetriNetUnfolderBase]: For 1074/1086 co-relation queries the response was YES. [2024-11-27 20:17:04,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6353 conditions, 2772 events. 1572/2772 cut-off events. For 1074/1086 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 16773 event pairs, 228 based on Foata normal form. 16/2724 useless extension candidates. Maximal degree in co-relation 6341. Up to 840 conditions per place. [2024-11-27 20:17:04,923 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 60 selfloop transitions, 24 changer transitions 54/155 dead transitions. [2024-11-27 20:17:04,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 155 transitions, 703 flow [2024-11-27 20:17:04,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-27 20:17:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-27 20:17:04,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 380 transitions. [2024-11-27 20:17:04,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-11-27 20:17:04,930 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 165 flow. Second operand 16 states and 380 transitions. [2024-11-27 20:17:04,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 155 transitions, 703 flow [2024-11-27 20:17:04,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 155 transitions, 631 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-11-27 20:17:04,957 INFO L231 Difference]: Finished difference. Result has 75 places, 63 transitions, 290 flow [2024-11-27 20:17:04,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=290, PETRI_PLACES=75, PETRI_TRANSITIONS=63} [2024-11-27 20:17:04,959 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 25 predicate places. [2024-11-27 20:17:04,960 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 63 transitions, 290 flow [2024-11-27 20:17:04,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 10 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:04,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:17:04,961 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, 1, 1, 1, 1] [2024-11-27 20:17:04,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 20:17:04,961 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:17:04,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:04,962 INFO L85 PathProgramCache]: Analyzing trace with hash 650313530, now seen corresponding path program 2 times [2024-11-27 20:17:04,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:17:04,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494858674] [2024-11-27 20:17:04,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:17:04,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:17:05,112 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 20:17:05,112 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:17:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:05,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:17:05,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494858674] [2024-11-27 20:17:05,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494858674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:17:05,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:17:05,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:17:05,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9402236] [2024-11-27 20:17:05,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:17:05,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:17:05,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:17:05,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:17:05,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:17:05,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-27 20:17:05,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 63 transitions, 290 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:05,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:17:05,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-27 20:17:05,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:17:06,139 INFO L124 PetriNetUnfolderBase]: 1101/1952 cut-off events. [2024-11-27 20:17:06,139 INFO L125 PetriNetUnfolderBase]: For 1359/1370 co-relation queries the response was YES. [2024-11-27 20:17:06,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5441 conditions, 1952 events. 1101/1952 cut-off events. For 1359/1370 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 11408 event pairs, 252 based on Foata normal form. 8/1874 useless extension candidates. Maximal degree in co-relation 5420. Up to 915 conditions per place. [2024-11-27 20:17:06,157 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 37 selfloop transitions, 8 changer transitions 34/98 dead transitions. [2024-11-27 20:17:06,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 98 transitions, 594 flow [2024-11-27 20:17:06,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:17:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 20:17:06,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-11-27 20:17:06,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5518518518518518 [2024-11-27 20:17:06,160 INFO L175 Difference]: Start difference. First operand has 75 places, 63 transitions, 290 flow. Second operand 6 states and 149 transitions. [2024-11-27 20:17:06,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 98 transitions, 594 flow [2024-11-27 20:17:06,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 98 transitions, 570 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-11-27 20:17:06,172 INFO L231 Difference]: Finished difference. Result has 72 places, 53 transitions, 254 flow [2024-11-27 20:17:06,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=254, PETRI_PLACES=72, PETRI_TRANSITIONS=53} [2024-11-27 20:17:06,174 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 22 predicate places. [2024-11-27 20:17:06,175 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 53 transitions, 254 flow [2024-11-27 20:17:06,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:06,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:17:06,176 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, 1, 1, 1, 1] [2024-11-27 20:17:06,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 20:17:06,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:17:06,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:06,177 INFO L85 PathProgramCache]: Analyzing trace with hash -368791382, now seen corresponding path program 3 times [2024-11-27 20:17:06,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:17:06,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711383341] [2024-11-27 20:17:06,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 20:17:06,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:17:06,292 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-27 20:17:06,293 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:17:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:08,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:17:08,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711383341] [2024-11-27 20:17:08,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711383341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:17:08,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:17:08,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 20:17:08,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254926487] [2024-11-27 20:17:08,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:17:08,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 20:17:08,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:17:08,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 20:17:08,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:17:08,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2024-11-27 20:17:08,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 53 transitions, 254 flow. Second operand has 11 states, 11 states have (on average 19.636363636363637) internal successors, (216), 11 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:08,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:17:08,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2024-11-27 20:17:08,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:17:09,323 INFO L124 PetriNetUnfolderBase]: 794/1566 cut-off events. [2024-11-27 20:17:09,324 INFO L125 PetriNetUnfolderBase]: For 912/938 co-relation queries the response was YES. [2024-11-27 20:17:09,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3994 conditions, 1566 events. 794/1566 cut-off events. For 912/938 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9185 event pairs, 258 based on Foata normal form. 8/1504 useless extension candidates. Maximal degree in co-relation 3973. Up to 565 conditions per place. [2024-11-27 20:17:09,337 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 24 selfloop transitions, 2 changer transitions 61/109 dead transitions. [2024-11-27 20:17:09,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 109 transitions, 604 flow [2024-11-27 20:17:09,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 20:17:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-27 20:17:09,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 296 transitions. [2024-11-27 20:17:09,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5481481481481482 [2024-11-27 20:17:09,340 INFO L175 Difference]: Start difference. First operand has 72 places, 53 transitions, 254 flow. Second operand 12 states and 296 transitions. [2024-11-27 20:17:09,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 109 transitions, 604 flow [2024-11-27 20:17:09,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 109 transitions, 565 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-11-27 20:17:09,346 INFO L231 Difference]: Finished difference. Result has 81 places, 45 transitions, 200 flow [2024-11-27 20:17:09,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=200, PETRI_PLACES=81, PETRI_TRANSITIONS=45} [2024-11-27 20:17:09,348 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 31 predicate places. [2024-11-27 20:17:09,348 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 45 transitions, 200 flow [2024-11-27 20:17:09,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.636363636363637) internal successors, (216), 11 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:09,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:17:09,349 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, 1, 1, 1, 1] [2024-11-27 20:17:09,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 20:17:09,349 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:17:09,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:09,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1092044898, now seen corresponding path program 4 times [2024-11-27 20:17:09,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:17:09,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084810967] [2024-11-27 20:17:09,350 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-27 20:17:09,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:17:09,450 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-27 20:17:09,450 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:17:09,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:09,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:17:09,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084810967] [2024-11-27 20:17:09,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084810967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:17:09,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:17:09,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:17:09,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147061343] [2024-11-27 20:17:09,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:17:09,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:17:09,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:17:09,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:17:09,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:17:09,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2024-11-27 20:17:09,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 45 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 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-11-27 20:17:09,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:17:09,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2024-11-27 20:17:09,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:17:10,367 INFO L124 PetriNetUnfolderBase]: 545/1078 cut-off events. [2024-11-27 20:17:10,367 INFO L125 PetriNetUnfolderBase]: For 1158/1168 co-relation queries the response was YES. [2024-11-27 20:17:10,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2915 conditions, 1078 events. 545/1078 cut-off events. For 1158/1168 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5661 event pairs, 100 based on Foata normal form. 11/1042 useless extension candidates. Maximal degree in co-relation 2889. Up to 469 conditions per place. [2024-11-27 20:17:10,376 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 25 selfloop transitions, 1 changer transitions 24/70 dead transitions. [2024-11-27 20:17:10,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 70 transitions, 388 flow [2024-11-27 20:17:10,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:17:10,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 20:17:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2024-11-27 20:17:10,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-11-27 20:17:10,378 INFO L175 Difference]: Start difference. First operand has 81 places, 45 transitions, 200 flow. Second operand 6 states and 155 transitions. [2024-11-27 20:17:10,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 70 transitions, 388 flow [2024-11-27 20:17:10,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 70 transitions, 332 flow, removed 20 selfloop flow, removed 13 redundant places. [2024-11-27 20:17:10,387 INFO L231 Difference]: Finished difference. Result has 65 places, 41 transitions, 150 flow [2024-11-27 20:17:10,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=150, PETRI_PLACES=65, PETRI_TRANSITIONS=41} [2024-11-27 20:17:10,391 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2024-11-27 20:17:10,391 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 41 transitions, 150 flow [2024-11-27 20:17:10,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 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-11-27 20:17:10,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:17:10,392 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, 1, 1, 1, 1] [2024-11-27 20:17:10,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 20:17:10,392 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:17:10,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:10,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1998531946, now seen corresponding path program 5 times [2024-11-27 20:17:10,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:17:10,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742152010] [2024-11-27 20:17:10,393 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-27 20:17:10,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:17:10,496 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 20:17:10,496 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:17:12,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:12,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:17:12,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742152010] [2024-11-27 20:17:12,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742152010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:17:12,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:17:12,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:17:12,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515167921] [2024-11-27 20:17:12,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:17:12,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 20:17:12,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:17:12,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 20:17:12,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-27 20:17:12,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-11-27 20:17:12,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 41 transitions, 150 flow. Second operand has 10 states, 10 states have (on average 21.6) internal successors, (216), 10 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:12,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:17:12,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-11-27 20:17:12,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:17:13,325 INFO L124 PetriNetUnfolderBase]: 332/727 cut-off events. [2024-11-27 20:17:13,325 INFO L125 PetriNetUnfolderBase]: For 224/226 co-relation queries the response was YES. [2024-11-27 20:17:13,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1640 conditions, 727 events. 332/727 cut-off events. For 224/226 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3712 event pairs, 102 based on Foata normal form. 8/685 useless extension candidates. Maximal degree in co-relation 1622. Up to 265 conditions per place. [2024-11-27 20:17:13,331 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 23 selfloop transitions, 3 changer transitions 18/66 dead transitions. [2024-11-27 20:17:13,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 306 flow [2024-11-27 20:17:13,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:17:13,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-27 20:17:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-11-27 20:17:13,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2024-11-27 20:17:13,334 INFO L175 Difference]: Start difference. First operand has 65 places, 41 transitions, 150 flow. Second operand 8 states and 205 transitions. [2024-11-27 20:17:13,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 306 flow [2024-11-27 20:17:13,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 66 transitions, 287 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-11-27 20:17:13,337 INFO L231 Difference]: Finished difference. Result has 65 places, 41 transitions, 150 flow [2024-11-27 20:17:13,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=150, PETRI_PLACES=65, PETRI_TRANSITIONS=41} [2024-11-27 20:17:13,340 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2024-11-27 20:17:13,341 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 41 transitions, 150 flow [2024-11-27 20:17:13,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.6) internal successors, (216), 10 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:13,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:17:13,342 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, 1, 1, 1, 1] [2024-11-27 20:17:13,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 20:17:13,343 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:17:13,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:13,344 INFO L85 PathProgramCache]: Analyzing trace with hash 230653836, now seen corresponding path program 6 times [2024-11-27 20:17:13,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:17:13,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071479299] [2024-11-27 20:17:13,344 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-27 20:17:13,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:17:13,429 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-27 20:17:13,430 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-27 20:17:13,430 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:17:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:17:13,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 20:17:13,562 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 20:17:13,563 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-27 20:17:13,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-27 20:17:13,572 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-27 20:17:13,572 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-27 20:17:13,572 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-27 20:17:13,572 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-27 20:17:13,572 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-27 20:17:13,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 20:17:13,573 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2024-11-27 20:17:13,711 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-27 20:17:13,714 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 20:17:13,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 08:17:13 BasicIcfg [2024-11-27 20:17:13,729 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 20:17:13,729 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 20:17:13,729 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 20:17:13,730 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 20:17:13,731 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:16:53" (3/4) ... [2024-11-27 20:17:13,733 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-27 20:17:13,735 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 20:17:13,737 INFO L158 Benchmark]: Toolchain (without parser) took 21952.27ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 104.7MB in the beginning and 361.5MB in the end (delta: -256.8MB). Peak memory consumption was 158.5MB. Max. memory is 16.1GB. [2024-11-27 20:17:13,738 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 167.8MB. Free memory is still 104.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:17:13,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 741.18ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 81.8MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-27 20:17:13,740 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.03ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 79.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:17:13,744 INFO L158 Benchmark]: Boogie Preprocessor took 62.46ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 76.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:17:13,744 INFO L158 Benchmark]: RCFGBuilder took 1276.64ms. Allocated memory is still 142.6MB. Free memory was 76.4MB in the beginning and 97.7MB in the end (delta: -21.3MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. [2024-11-27 20:17:13,745 INFO L158 Benchmark]: TraceAbstraction took 19776.40ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 97.1MB in the beginning and 361.6MB in the end (delta: -264.6MB). Peak memory consumption was 144.6MB. Max. memory is 16.1GB. [2024-11-27 20:17:13,745 INFO L158 Benchmark]: Witness Printer took 6.25ms. Allocated memory is still 553.6MB. Free memory was 361.6MB in the beginning and 361.5MB in the end (delta: 110.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:17:13,747 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.62ms. Allocated memory is still 167.8MB. Free memory is still 104.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 741.18ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 81.8MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.03ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 79.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.46ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 76.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1276.64ms. Allocated memory is still 142.6MB. Free memory was 76.4MB in the beginning and 97.7MB in the end (delta: -21.3MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. * TraceAbstraction took 19776.40ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 97.1MB in the beginning and 361.6MB in the end (delta: -264.6MB). Peak memory consumption was 144.6MB. Max. memory is 16.1GB. * Witness Printer took 6.25ms. Allocated memory is still 553.6MB. Free memory was 361.6MB in the beginning and 361.5MB in the end (delta: 110.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t666; [L835] FCALL, FORK 0 pthread_create(&t666, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t666=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L836] 0 pthread_t t667; [L837] FCALL, FORK 0 pthread_create(&t667, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t666=-2, t667=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L838] 0 pthread_t t668; [L839] FCALL, FORK 0 pthread_create(&t668, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t666=-2, t667=-1, t668=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L786] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L806] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L809] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L746] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L812] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666=-2, t667=-1, t668=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L843] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L843] RET 0 assume_abort_if_not(main$tmp_guard0) [L845] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L846] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L847] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L848] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L849] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666=-2, t667=-1, t668=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L852] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666=-2, t667=-1, t668=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L854] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L18] 0 __assert_fail ("0", "mix025_pso.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 835]: 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: 837]: 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: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 70 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 492 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 473 mSDsluCounter, 249 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 230 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1827 IncrementalHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 19 mSDtfsCounter, 1827 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=6, InterpolantAutomatonStates: 69, 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, 1.0s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 2022 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-27 20:17:13,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3bbcbfea07b4de27a61735028fd08097276598be4815bd7ea5f14ba44ebf2380 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:17:17,264 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:17:17,460 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-27 20:17:17,470 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:17:17,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:17:17,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:17:17,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:17:17,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:17:17,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:17:17,504 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:17:17,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:17:17,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:17:17,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:17:17,505 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:17:17,505 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:17:17,506 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:17:17,506 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:17:17,506 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:17:17,506 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:17:17,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:17:17,507 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 20:17:17,507 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 20:17:17,507 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 20:17:17,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:17:17,507 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:17:17,508 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 20:17:17,508 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 20:17:17,508 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:17:17,508 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:17:17,508 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:17:17,508 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:17:17,508 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:17:17,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:17:17,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:17:17,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:17:17,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:17:17,509 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:17:17,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:17:17,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:17:17,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:17:17,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:17:17,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:17:17,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:17:17,511 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 20:17:17,511 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 20:17:17,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:17:17,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:17:17,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:17:17,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:17:17,511 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_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3bbcbfea07b4de27a61735028fd08097276598be4815bd7ea5f14ba44ebf2380 [2024-11-27 20:17:17,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:17:17,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:17:17,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:17:17,985 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:17:17,986 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:17:17,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i [2024-11-27 20:17:21,929 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/data/40a6451fb/2105f74cceb7498ca8415b736bb88fc7/FLAG219370349 [2024-11-27 20:17:22,407 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:17:22,408 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i [2024-11-27 20:17:22,436 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/data/40a6451fb/2105f74cceb7498ca8415b736bb88fc7/FLAG219370349 [2024-11-27 20:17:22,468 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/data/40a6451fb/2105f74cceb7498ca8415b736bb88fc7 [2024-11-27 20:17:22,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:17:22,476 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:17:22,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:17:22,480 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:17:22,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:17:22,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:17:22" (1/1) ... [2024-11-27 20:17:22,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c6ac6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:17:22, skipping insertion in model container [2024-11-27 20:17:22,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:17:22" (1/1) ... [2024-11-27 20:17:22,561 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:17:23,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:17:23,184 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:17:23,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:17:23,329 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:17:23,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:17:23 WrapperNode [2024-11-27 20:17:23,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:17:23,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:17:23,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:17:23,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:17:23,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:17:23" (1/1) ... [2024-11-27 20:17:23,384 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:17:23" (1/1) ... [2024-11-27 20:17:23,430 INFO L138 Inliner]: procedures = 176, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 121 [2024-11-27 20:17:23,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:17:23,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:17:23,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:17:23,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:17:23,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:17:23" (1/1) ... [2024-11-27 20:17:23,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:17:23" (1/1) ... [2024-11-27 20:17:23,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:17:23" (1/1) ... [2024-11-27 20:17:23,485 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-11-27 20:17:23,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:17:23" (1/1) ... [2024-11-27 20:17:23,494 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:17:23" (1/1) ... [2024-11-27 20:17:23,514 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:17:23" (1/1) ... [2024-11-27 20:17:23,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:17:23" (1/1) ... [2024-11-27 20:17:23,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:17:23" (1/1) ... [2024-11-27 20:17:23,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:17:23" (1/1) ... [2024-11-27 20:17:23,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:17:23" (1/1) ... [2024-11-27 20:17:23,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:17:23,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:17:23,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:17:23,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:17:23,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:17:23" (1/1) ... [2024-11-27 20:17:23,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:17:23,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:17:23,593 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:17:23,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:17:23,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-27 20:17:23,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:17:23,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 20:17:23,638 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-27 20:17:23,639 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-27 20:17:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-27 20:17:23,639 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-27 20:17:23,640 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-27 20:17:23,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-27 20:17:23,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-27 20:17:23,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:17:23,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:17:23,643 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-27 20:17:23,876 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:17:23,879 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:17:24,506 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-27 20:17:24,506 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:17:24,877 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:17:24,878 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 20:17:24,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:17:24 BoogieIcfgContainer [2024-11-27 20:17:24,881 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:17:24,885 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:17:24,885 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:17:24,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:17:24,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:17:22" (1/3) ... [2024-11-27 20:17:24,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2620e1bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:17:24, skipping insertion in model container [2024-11-27 20:17:24,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:17:23" (2/3) ... [2024-11-27 20:17:24,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2620e1bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:17:24, skipping insertion in model container [2024-11-27 20:17:24,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:17:24" (3/3) ... [2024-11-27 20:17:24,902 INFO L128 eAbstractionObserver]: Analyzing ICFG mix025_pso.opt_rmo.opt.i [2024-11-27 20:17:24,924 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:17:24,927 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix025_pso.opt_rmo.opt.i that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-27 20:17:24,927 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-27 20:17:25,032 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-27 20:17:25,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2024-11-27 20:17:25,173 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2024-11-27 20:17:25,178 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:17:25,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-11-27 20:17:25,185 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2024-11-27 20:17:25,189 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2024-11-27 20:17:25,199 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:17:25,225 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;@50e9a6a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:17:25,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-27 20:17:25,237 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 20:17:25,237 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-11-27 20:17:25,237 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:17:25,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:17:25,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-27 20:17:25,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:17:25,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:25,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1469477766, now seen corresponding path program 1 times [2024-11-27 20:17:25,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:17:25,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [308738048] [2024-11-27 20:17:25,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:17:25,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:25,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:17:25,276 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:17:25,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:17:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:17:25,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 20:17:25,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:25,525 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:17:25,526 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:17:25,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308738048] [2024-11-27 20:17:25,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308738048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:17:25,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:17:25,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 20:17:25,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115897977] [2024-11-27 20:17:25,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:17:25,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:17:25,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:17:25,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:17:25,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:17:25,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 45 [2024-11-27 20:17:25,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:25,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:17:25,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 45 [2024-11-27 20:17:25,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:17:26,321 INFO L124 PetriNetUnfolderBase]: 603/1154 cut-off events. [2024-11-27 20:17:26,321 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-27 20:17:26,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2113 conditions, 1154 events. 603/1154 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7495 event pairs, 96 based on Foata normal form. 72/1207 useless extension candidates. Maximal degree in co-relation 2102. Up to 742 conditions per place. [2024-11-27 20:17:26,351 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 29 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2024-11-27 20:17:26,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 180 flow [2024-11-27 20:17:26,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:17:26,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:17:26,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-11-27 20:17:26,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7481481481481481 [2024-11-27 20:17:26,373 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 101 transitions. [2024-11-27 20:17:26,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 180 flow [2024-11-27 20:17:26,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 51 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-27 20:17:26,385 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2024-11-27 20:17:26,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-27 20:17:26,396 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2024-11-27 20:17:26,397 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2024-11-27 20:17:26,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:26,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:17:26,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:17:26,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 20:17:26,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:26,602 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:17:26,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:26,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1759547249, now seen corresponding path program 1 times [2024-11-27 20:17:26,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:17:26,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [353559413] [2024-11-27 20:17:26,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:17:26,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:26,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:17:26,610 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:17:26,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:17:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:17:26,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-27 20:17:26,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:26,808 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:17:26,809 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:17:26,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353559413] [2024-11-27 20:17:26,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353559413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:17:26,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:17:26,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 20:17:26,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61779266] [2024-11-27 20:17:26,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:17:26,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:17:26,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:17:26,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:17:26,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:17:26,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-11-27 20:17:26,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:26,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:17:26,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-11-27 20:17:26,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:17:27,279 INFO L124 PetriNetUnfolderBase]: 528/1064 cut-off events. [2024-11-27 20:17:27,279 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-11-27 20:17:27,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1980 conditions, 1064 events. 528/1064 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6950 event pairs, 528 based on Foata normal form. 36/1054 useless extension candidates. Maximal degree in co-relation 1970. Up to 811 conditions per place. [2024-11-27 20:17:27,292 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 17 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2024-11-27 20:17:27,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 120 flow [2024-11-27 20:17:27,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:17:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:17:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-27 20:17:27,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-11-27 20:17:27,297 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 80 transitions. [2024-11-27 20:17:27,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 120 flow [2024-11-27 20:17:27,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:17:27,301 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2024-11-27 20:17:27,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-11-27 20:17:27,305 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2024-11-27 20:17:27,306 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2024-11-27 20:17:27,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:27,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:17:27,306 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:17:27,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-27 20:17:27,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:27,507 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:17:27,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:27,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1759547333, now seen corresponding path program 1 times [2024-11-27 20:17:27,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:17:27,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2122190924] [2024-11-27 20:17:27,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:17:27,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:27,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:17:27,512 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:17:27,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:17:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:17:27,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:17:27,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:27,740 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:17:27,740 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:17:27,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122190924] [2024-11-27 20:17:27,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122190924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:17:27,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:17:27,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:17:27,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940045472] [2024-11-27 20:17:27,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:17:27,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:17:27,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:17:27,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:17:27,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:17:27,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-27 20:17:27,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:27,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:17:27,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-27 20:17:27,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:17:28,413 INFO L124 PetriNetUnfolderBase]: 1213/2145 cut-off events. [2024-11-27 20:17:28,417 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:17:28,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4041 conditions, 2145 events. 1213/2145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13555 event pairs, 147 based on Foata normal form. 80/2182 useless extension candidates. Maximal degree in co-relation 4035. Up to 1081 conditions per place. [2024-11-27 20:17:28,443 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 39 selfloop transitions, 5 changer transitions 1/58 dead transitions. [2024-11-27 20:17:28,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 218 flow [2024-11-27 20:17:28,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:17:28,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-27 20:17:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2024-11-27 20:17:28,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-11-27 20:17:28,448 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 4 states and 115 transitions. [2024-11-27 20:17:28,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 218 flow [2024-11-27 20:17:28,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 20:17:28,453 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 111 flow [2024-11-27 20:17:28,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=43, 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=4, PETRI_FLOW=111, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-11-27 20:17:28,455 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2024-11-27 20:17:28,455 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 111 flow [2024-11-27 20:17:28,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:28,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:17:28,456 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-11-27 20:17:28,469 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-27 20:17:28,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:28,657 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:17:28,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:28,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1943336400, now seen corresponding path program 1 times [2024-11-27 20:17:28,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:17:28,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [444426504] [2024-11-27 20:17:28,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:17:28,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:28,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:17:28,661 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:17:28,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 20:17:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:17:28,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:17:28,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:28,869 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:17:28,870 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:17:28,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444426504] [2024-11-27 20:17:28,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444426504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:17:28,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:17:28,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:17:28,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395713992] [2024-11-27 20:17:28,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:17:28,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:17:28,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:17:28,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:17:28,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:17:28,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-27 20:17:28,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:28,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:17:28,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-27 20:17:28,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:17:29,451 INFO L124 PetriNetUnfolderBase]: 809/1441 cut-off events. [2024-11-27 20:17:29,452 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2024-11-27 20:17:29,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3248 conditions, 1441 events. 809/1441 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8016 event pairs, 73 based on Foata normal form. 68/1474 useless extension candidates. Maximal degree in co-relation 3239. Up to 521 conditions per place. [2024-11-27 20:17:29,466 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 49 selfloop transitions, 8 changer transitions 1/71 dead transitions. [2024-11-27 20:17:29,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 314 flow [2024-11-27 20:17:29,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:17:29,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 20:17:29,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2024-11-27 20:17:29,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2024-11-27 20:17:29,471 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 111 flow. Second operand 5 states and 145 transitions. [2024-11-27 20:17:29,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 314 flow [2024-11-27 20:17:29,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 304 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-27 20:17:29,475 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 151 flow [2024-11-27 20:17:29,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-11-27 20:17:29,477 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-11-27 20:17:29,478 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 151 flow [2024-11-27 20:17:29,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:29,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:17:29,478 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] [2024-11-27 20:17:29,489 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-27 20:17:29,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:29,680 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:17:29,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:29,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1408831091, now seen corresponding path program 1 times [2024-11-27 20:17:29,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:17:29,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [961071410] [2024-11-27 20:17:29,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:17:29,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:29,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:17:29,687 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:17:29,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 20:17:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:17:29,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 20:17:29,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:29,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:29,938 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:17:29,938 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:17:29,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961071410] [2024-11-27 20:17:29,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961071410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:17:29,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:17:29,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:17:29,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204234244] [2024-11-27 20:17:29,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:17:29,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:17:29,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:17:29,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:17:29,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:17:29,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-27 20:17:29,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:29,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:17:29,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-27 20:17:29,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:17:30,432 INFO L124 PetriNetUnfolderBase]: 477/825 cut-off events. [2024-11-27 20:17:30,433 INFO L125 PetriNetUnfolderBase]: For 730/730 co-relation queries the response was YES. [2024-11-27 20:17:30,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2138 conditions, 825 events. 477/825 cut-off events. For 730/730 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3736 event pairs, 59 based on Foata normal form. 36/831 useless extension candidates. Maximal degree in co-relation 2127. Up to 268 conditions per place. [2024-11-27 20:17:30,443 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 43 selfloop transitions, 11 changer transitions 1/68 dead transitions. [2024-11-27 20:17:30,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 325 flow [2024-11-27 20:17:30,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:17:30,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 20:17:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2024-11-27 20:17:30,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2024-11-27 20:17:30,447 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 151 flow. Second operand 6 states and 159 transitions. [2024-11-27 20:17:30,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 325 flow [2024-11-27 20:17:30,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 300 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-27 20:17:30,459 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 165 flow [2024-11-27 20:17:30,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2024-11-27 20:17:30,460 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2024-11-27 20:17:30,460 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 165 flow [2024-11-27 20:17:30,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:30,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:17:30,463 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, 1, 1, 1, 1] [2024-11-27 20:17:30,475 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-27 20:17:30,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:30,667 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:17:30,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:30,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1280686050, now seen corresponding path program 1 times [2024-11-27 20:17:30,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:17:30,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [320706963] [2024-11-27 20:17:30,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:17:30,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:30,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:17:30,672 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:17:30,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 20:17:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:17:30,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-27 20:17:30,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:31,174 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:17:31,174 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:17:31,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320706963] [2024-11-27 20:17:31,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320706963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:17:31,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:17:31,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:17:31,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818595899] [2024-11-27 20:17:31,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:17:31,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:17:31,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:17:31,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:17:31,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:17:31,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45 [2024-11-27 20:17:31,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 165 flow. Second operand has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:31,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:17:31,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45 [2024-11-27 20:17:31,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:17:32,083 INFO L124 PetriNetUnfolderBase]: 984/1613 cut-off events. [2024-11-27 20:17:32,083 INFO L125 PetriNetUnfolderBase]: For 1411/1411 co-relation queries the response was YES. [2024-11-27 20:17:32,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4224 conditions, 1613 events. 984/1613 cut-off events. For 1411/1411 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7846 event pairs, 192 based on Foata normal form. 8/1607 useless extension candidates. Maximal degree in co-relation 4212. Up to 807 conditions per place. [2024-11-27 20:17:32,095 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 45 selfloop transitions, 7 changer transitions 37/99 dead transitions. [2024-11-27 20:17:32,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 99 transitions, 551 flow [2024-11-27 20:17:32,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:17:32,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-27 20:17:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 210 transitions. [2024-11-27 20:17:32,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2024-11-27 20:17:32,098 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 165 flow. Second operand 9 states and 210 transitions. [2024-11-27 20:17:32,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 99 transitions, 551 flow [2024-11-27 20:17:32,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 99 transitions, 434 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-11-27 20:17:32,118 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 153 flow [2024-11-27 20:17:32,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=153, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2024-11-27 20:17:32,120 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2024-11-27 20:17:32,120 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 153 flow [2024-11-27 20:17:32,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:32,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:17:32,121 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, 1, 1, 1, 1] [2024-11-27 20:17:32,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-27 20:17:32,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:32,325 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:17:32,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:32,326 INFO L85 PathProgramCache]: Analyzing trace with hash -676305346, now seen corresponding path program 2 times [2024-11-27 20:17:32,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:17:32,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1503342173] [2024-11-27 20:17:32,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:17:32,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:32,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:17:32,331 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:17:32,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 20:17:32,469 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 20:17:32,469 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:17:32,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-27 20:17:32,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:33,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:33,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:17:33,226 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:17:33,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503342173] [2024-11-27 20:17:33,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503342173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:17:33,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:17:33,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:17:33,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527156191] [2024-11-27 20:17:33,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:17:33,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 20:17:33,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:17:33,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 20:17:33,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-27 20:17:33,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-11-27 20:17:33,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 44 transitions, 153 flow. Second operand has 10 states, 10 states have (on average 20.7) internal successors, (207), 10 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:33,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:17:33,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-11-27 20:17:33,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:17:33,996 INFO L124 PetriNetUnfolderBase]: 484/960 cut-off events. [2024-11-27 20:17:33,996 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2024-11-27 20:17:34,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2039 conditions, 960 events. 484/960 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5002 event pairs, 107 based on Foata normal form. 8/923 useless extension candidates. Maximal degree in co-relation 2025. Up to 232 conditions per place. [2024-11-27 20:17:34,005 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 37 selfloop transitions, 5 changer transitions 17/83 dead transitions. [2024-11-27 20:17:34,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 83 transitions, 362 flow [2024-11-27 20:17:34,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 20:17:34,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-27 20:17:34,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 250 transitions. [2024-11-27 20:17:34,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-11-27 20:17:34,015 INFO L175 Difference]: Start difference. First operand has 61 places, 44 transitions, 153 flow. Second operand 10 states and 250 transitions. [2024-11-27 20:17:34,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 83 transitions, 362 flow [2024-11-27 20:17:34,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 83 transitions, 336 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-11-27 20:17:34,019 INFO L231 Difference]: Finished difference. Result has 64 places, 45 transitions, 159 flow [2024-11-27 20:17:34,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=159, PETRI_PLACES=64, PETRI_TRANSITIONS=45} [2024-11-27 20:17:34,022 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2024-11-27 20:17:34,022 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 159 flow [2024-11-27 20:17:34,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.7) internal successors, (207), 10 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:34,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:17:34,026 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, 1, 1, 1, 1] [2024-11-27 20:17:34,041 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-27 20:17:34,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:34,227 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:17:34,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:34,231 INFO L85 PathProgramCache]: Analyzing trace with hash -235144176, now seen corresponding path program 3 times [2024-11-27 20:17:34,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:17:34,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1542437156] [2024-11-27 20:17:34,232 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 20:17:34,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:34,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:17:34,237 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:17:34,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 20:17:34,383 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-27 20:17:34,383 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:17:34,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-27 20:17:34,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:34,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:34,595 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:17:34,595 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:17:34,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542437156] [2024-11-27 20:17:34,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542437156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:17:34,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:17:34,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:17:34,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961645626] [2024-11-27 20:17:34,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:17:34,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:17:34,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:17:34,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:17:34,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:17:34,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45 [2024-11-27 20:17:34,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 45 transitions, 159 flow. Second operand has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:34,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:17:34,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45 [2024-11-27 20:17:34,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:17:35,474 INFO L124 PetriNetUnfolderBase]: 1129/1882 cut-off events. [2024-11-27 20:17:35,477 INFO L125 PetriNetUnfolderBase]: For 796/814 co-relation queries the response was YES. [2024-11-27 20:17:35,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4755 conditions, 1882 events. 1129/1882 cut-off events. For 796/814 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9548 event pairs, 188 based on Foata normal form. 11/1886 useless extension candidates. Maximal degree in co-relation 4740. Up to 952 conditions per place. [2024-11-27 20:17:35,487 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 37 selfloop transitions, 7 changer transitions 49/103 dead transitions. [2024-11-27 20:17:35,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 103 transitions, 531 flow [2024-11-27 20:17:35,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:17:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-27 20:17:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 212 transitions. [2024-11-27 20:17:35,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5234567901234568 [2024-11-27 20:17:35,489 INFO L175 Difference]: Start difference. First operand has 64 places, 45 transitions, 159 flow. Second operand 9 states and 212 transitions. [2024-11-27 20:17:35,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 103 transitions, 531 flow [2024-11-27 20:17:35,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 502 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-11-27 20:17:35,496 INFO L231 Difference]: Finished difference. Result has 67 places, 43 transitions, 164 flow [2024-11-27 20:17:35,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=164, PETRI_PLACES=67, PETRI_TRANSITIONS=43} [2024-11-27 20:17:35,499 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 17 predicate places. [2024-11-27 20:17:35,501 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 43 transitions, 164 flow [2024-11-27 20:17:35,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:35,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:17:35,502 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, 1, 1, 1, 1] [2024-11-27 20:17:35,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-27 20:17:35,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:35,702 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:17:35,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:35,703 INFO L85 PathProgramCache]: Analyzing trace with hash -2004362050, now seen corresponding path program 4 times [2024-11-27 20:17:35,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:17:35,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1456903866] [2024-11-27 20:17:35,704 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-27 20:17:35,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:35,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:17:35,708 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:17:35,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-27 20:17:35,836 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-27 20:17:35,836 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:17:35,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-27 20:17:35,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:35,942 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:17:35,943 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:17:35,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456903866] [2024-11-27 20:17:35,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456903866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:17:35,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:17:35,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:17:35,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023870862] [2024-11-27 20:17:35,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:17:35,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:17:35,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:17:35,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:17:35,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:17:35,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-27 20:17:35,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 43 transitions, 164 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:35,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:17:35,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-27 20:17:35,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:17:36,425 INFO L124 PetriNetUnfolderBase]: 596/1175 cut-off events. [2024-11-27 20:17:36,426 INFO L125 PetriNetUnfolderBase]: For 297/306 co-relation queries the response was YES. [2024-11-27 20:17:36,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2645 conditions, 1175 events. 596/1175 cut-off events. For 297/306 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6696 event pairs, 289 based on Foata normal form. 12/1116 useless extension candidates. Maximal degree in co-relation 2628. Up to 529 conditions per place. [2024-11-27 20:17:36,434 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 23 selfloop transitions, 2 changer transitions 21/67 dead transitions. [2024-11-27 20:17:36,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 67 transitions, 321 flow [2024-11-27 20:17:36,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:17:36,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 20:17:36,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-11-27 20:17:36,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5518518518518518 [2024-11-27 20:17:36,437 INFO L175 Difference]: Start difference. First operand has 67 places, 43 transitions, 164 flow. Second operand 6 states and 149 transitions. [2024-11-27 20:17:36,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 67 transitions, 321 flow [2024-11-27 20:17:36,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 67 transitions, 287 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-11-27 20:17:36,441 INFO L231 Difference]: Finished difference. Result has 62 places, 43 transitions, 154 flow [2024-11-27 20:17:36,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=62, PETRI_TRANSITIONS=43} [2024-11-27 20:17:36,445 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2024-11-27 20:17:36,445 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 43 transitions, 154 flow [2024-11-27 20:17:36,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:36,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:17:36,446 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, 1, 1, 1, 1] [2024-11-27 20:17:36,459 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-27 20:17:36,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:36,647 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-27 20:17:36,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:36,648 INFO L85 PathProgramCache]: Analyzing trace with hash -730651894, now seen corresponding path program 5 times [2024-11-27 20:17:36,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:17:36,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [142765128] [2024-11-27 20:17:36,649 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-27 20:17:36,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:36,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:17:36,652 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:17:36,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-27 20:17:36,798 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 20:17:36,798 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-27 20:17:36,798 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:17:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:17:36,957 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-27 20:17:36,957 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 20:17:36,958 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-27 20:17:36,961 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-27 20:17:36,961 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-27 20:17:36,961 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-27 20:17:36,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-27 20:17:36,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-27 20:17:36,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-27 20:17:36,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-27 20:17:37,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:37,163 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-11-27 20:17:37,265 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-27 20:17:37,265 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 20:17:37,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 08:17:37 BasicIcfg [2024-11-27 20:17:37,272 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 20:17:37,273 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 20:17:37,273 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 20:17:37,274 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 20:17:37,274 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:17:24" (3/4) ... [2024-11-27 20:17:37,277 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-27 20:17:37,278 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 20:17:37,279 INFO L158 Benchmark]: Toolchain (without parser) took 14803.29ms. Allocated memory was 83.9MB in the beginning and 167.8MB in the end (delta: 83.9MB). Free memory was 58.8MB in the beginning and 79.5MB in the end (delta: -20.7MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. [2024-11-27 20:17:37,280 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 83.9MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:17:37,280 INFO L158 Benchmark]: CACSL2BoogieTranslator took 853.05ms. Allocated memory is still 83.9MB. Free memory was 58.5MB in the beginning and 35.5MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-27 20:17:37,281 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.98ms. Allocated memory is still 83.9MB. Free memory was 35.5MB in the beginning and 33.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:17:37,281 INFO L158 Benchmark]: Boogie Preprocessor took 99.50ms. Allocated memory is still 83.9MB. Free memory was 33.3MB in the beginning and 30.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:17:37,281 INFO L158 Benchmark]: RCFGBuilder took 1346.50ms. Allocated memory is still 83.9MB. Free memory was 30.5MB in the beginning and 36.7MB in the end (delta: -6.2MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-11-27 20:17:37,282 INFO L158 Benchmark]: TraceAbstraction took 12387.63ms. Allocated memory was 83.9MB in the beginning and 167.8MB in the end (delta: 83.9MB). Free memory was 36.2MB in the beginning and 81.4MB in the end (delta: -45.2MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2024-11-27 20:17:37,282 INFO L158 Benchmark]: Witness Printer took 5.31ms. Allocated memory is still 167.8MB. Free memory was 81.4MB in the beginning and 79.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:17:37,285 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.57ms. Allocated memory is still 83.9MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 853.05ms. Allocated memory is still 83.9MB. Free memory was 58.5MB in the beginning and 35.5MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.98ms. Allocated memory is still 83.9MB. Free memory was 35.5MB in the beginning and 33.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 99.50ms. Allocated memory is still 83.9MB. Free memory was 33.3MB in the beginning and 30.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1346.50ms. Allocated memory is still 83.9MB. Free memory was 30.5MB in the beginning and 36.7MB in the end (delta: -6.2MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12387.63ms. Allocated memory was 83.9MB in the beginning and 167.8MB in the end (delta: 83.9MB). Free memory was 36.2MB in the beginning and 81.4MB in the end (delta: -45.2MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. * Witness Printer took 5.31ms. Allocated memory is still 167.8MB. Free memory was 81.4MB in the beginning and 79.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t666; [L835] FCALL, FORK 0 pthread_create(&t666, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t666=8190, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L836] 0 pthread_t t667; [L837] FCALL, FORK 0 pthread_create(&t667, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t666=8190, t667=8191, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L838] 0 pthread_t t668; [L839] FCALL, FORK 0 pthread_create(&t668, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t666=8190, t667=8191, t668=8192, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L786] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L806] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L809] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L746] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L812] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666=8190, t667=8191, t668=8192, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L843] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L843] RET 0 assume_abort_if_not(main$tmp_guard0) [L845] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L846] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L847] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L848] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L849] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666=8190, t667=8191, t668=8192, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L852] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666=8190, t667=8191, t668=8192, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L854] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L18] 0 __assert_fail ("0", "mix025_pso.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 839]: 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: 835]: 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: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 70 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 411 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 393 mSDsluCounter, 189 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 169 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1484 IncrementalHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 20 mSDtfsCounter, 1484 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=5, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 236 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 824 SizeOfPredicates, 30 NumberOfNonLiveVariables, 910 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-27 20:17:37,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a5cad9a-d8cb-4cd7-995a-befb06981898/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample