./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 14:22:15,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 14:22:15,412 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-12-02 14:22:15,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 14:22:15,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 14:22:15,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 14:22:15,437 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 14:22:15,437 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 14:22:15,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 14:22:15,438 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 14:22:15,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 14:22:15,438 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 14:22:15,438 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 14:22:15,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 14:22:15,438 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 14:22:15,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 14:22:15,439 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 14:22:15,439 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 14:22:15,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 14:22:15,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 14:22:15,439 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-02 14:22:15,439 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-02 14:22:15,439 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-02 14:22:15,439 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 14:22:15,439 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 14:22:15,439 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 14:22:15,440 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 14:22:15,440 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 14:22:15,440 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 14:22:15,440 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 14:22:15,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:22:15,440 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:22:15,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:22:15,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:22:15,440 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 14:22:15,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:22:15,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:22:15,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:22:15,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:22:15,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 14:22:15,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 14:22:15,441 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 14:22:15,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 14:22:15,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 14:22:15,441 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 14:22:15,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 14:22:15,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 14:22:15,442 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_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 [2024-12-02 14:22:15,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 14:22:15,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 14:22:15,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 14:22:15,653 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 14:22:15,653 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 14:22:15,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-12-02 14:22:18,332 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/data/9f3412898/ec18765e33c6404086d0e3556805cb17/FLAG167a6da57 [2024-12-02 14:22:18,589 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 14:22:18,589 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-12-02 14:22:18,603 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/data/9f3412898/ec18765e33c6404086d0e3556805cb17/FLAG167a6da57 [2024-12-02 14:22:18,910 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/data/9f3412898/ec18765e33c6404086d0e3556805cb17 [2024-12-02 14:22:18,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 14:22:18,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 14:22:18,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 14:22:18,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 14:22:18,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 14:22:18,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:22:18" (1/1) ... [2024-12-02 14:22:18,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42b24ce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:18, skipping insertion in model container [2024-12-02 14:22:18,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:22:18" (1/1) ... [2024-12-02 14:22:18,943 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 14:22:19,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:22:19,236 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 14:22:19,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:22:19,316 INFO L204 MainTranslator]: Completed translation [2024-12-02 14:22:19,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:19 WrapperNode [2024-12-02 14:22:19,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 14:22:19,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 14:22:19,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 14:22:19,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 14:22:19,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:19" (1/1) ... [2024-12-02 14:22:19,337 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:19" (1/1) ... [2024-12-02 14:22:19,357 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-12-02 14:22:19,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 14:22:19,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 14:22:19,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 14:22:19,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 14:22:19,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:19" (1/1) ... [2024-12-02 14:22:19,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:19" (1/1) ... [2024-12-02 14:22:19,368 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:19" (1/1) ... [2024-12-02 14:22:19,383 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-12-02 14:22:19,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:19" (1/1) ... [2024-12-02 14:22:19,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:19" (1/1) ... [2024-12-02 14:22:19,390 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:19" (1/1) ... [2024-12-02 14:22:19,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:19" (1/1) ... [2024-12-02 14:22:19,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:19" (1/1) ... [2024-12-02 14:22:19,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:19" (1/1) ... [2024-12-02 14:22:19,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:19" (1/1) ... [2024-12-02 14:22:19,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 14:22:19,398 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 14:22:19,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 14:22:19,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 14:22:19,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:19" (1/1) ... [2024-12-02 14:22:19,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:22:19,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:22:19,428 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 14:22:19,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 14:22:19,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-12-02 14:22:19,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 14:22:19,454 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-12-02 14:22:19,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-12-02 14:22:19,455 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-12-02 14:22:19,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-12-02 14:22:19,455 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-12-02 14:22:19,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-12-02 14:22:19,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 14:22:19,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-12-02 14:22:19,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 14:22:19,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 14:22:19,456 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-02 14:22:19,565 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 14:22:19,566 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 14:22:19,815 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-02 14:22:19,816 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 14:22:19,996 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 14:22:19,996 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 14:22:19,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:22:19 BoogieIcfgContainer [2024-12-02 14:22:19,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 14:22:19,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 14:22:19,999 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 14:22:20,003 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 14:22:20,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:22:18" (1/3) ... [2024-12-02 14:22:20,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664b4362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:22:20, skipping insertion in model container [2024-12-02 14:22:20,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:19" (2/3) ... [2024-12-02 14:22:20,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664b4362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:22:20, skipping insertion in model container [2024-12-02 14:22:20,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:22:19" (3/3) ... [2024-12-02 14:22:20,006 INFO L128 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-12-02 14:22:20,020 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 14:22:20,022 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-12-02 14:22:20,022 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-02 14:22:20,072 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-12-02 14:22:20,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-12-02 14:22:20,132 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-12-02 14:22:20,134 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 14:22:20,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-12-02 14:22:20,137 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-12-02 14:22:20,140 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-12-02 14:22:20,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 14:22:20,158 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;@677af8d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 14:22:20,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-12-02 14:22:20,164 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 14:22:20,165 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-12-02 14:22:20,165 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 14:22:20,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:22:20,165 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:22:20,166 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 14:22:20,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:22:20,170 INFO L85 PathProgramCache]: Analyzing trace with hash -655888620, now seen corresponding path program 1 times [2024-12-02 14:22:20,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:22:20,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051420191] [2024-12-02 14:22:20,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:22:20,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:22:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:22:20,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:22:20,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:22:20,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051420191] [2024-12-02 14:22:20,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051420191] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:22:20,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:22:20,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 14:22:20,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273342346] [2024-12-02 14:22:20,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:22:20,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:22:20,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:22:20,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:22:20,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:22:20,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 44 [2024-12-02 14:22:20,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:20,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:22:20,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 44 [2024-12-02 14:22:20,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:22:20,871 INFO L124 PetriNetUnfolderBase]: 407/797 cut-off events. [2024-12-02 14:22:20,871 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 14:22:20,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1460 conditions, 797 events. 407/797 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5335 event pairs, 74 based on Foata normal form. 48/832 useless extension candidates. Maximal degree in co-relation 1449. Up to 496 conditions per place. [2024-12-02 14:22:20,879 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 27 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2024-12-02 14:22:20,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 167 flow [2024-12-02 14:22:20,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:22:20,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 14:22:20,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-12-02 14:22:20,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2024-12-02 14:22:20,891 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 96 transitions. [2024-12-02 14:22:20,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 167 flow [2024-12-02 14:22:20,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 14:22:20,896 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-12-02 14:22:20,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-12-02 14:22:20,901 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-12-02 14:22:20,901 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-12-02 14:22:20,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:20,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:22:20,902 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:22:20,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 14:22:20,902 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 14:22:20,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:22:20,903 INFO L85 PathProgramCache]: Analyzing trace with hash 560481029, now seen corresponding path program 1 times [2024-12-02 14:22:20,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:22:20,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224385284] [2024-12-02 14:22:20,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:22:20,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:22:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:22:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:22:20,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:22:20,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224385284] [2024-12-02 14:22:20,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224385284] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:22:20,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:22:20,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 14:22:20,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383043117] [2024-12-02 14:22:20,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:22:20,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:22:20,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:22:20,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:22:20,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:22:20,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-12-02 14:22:20,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:20,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:22:20,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-12-02 14:22:20,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:22:21,123 INFO L124 PetriNetUnfolderBase]: 361/697 cut-off events. [2024-12-02 14:22:21,123 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-12-02 14:22:21,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 697 events. 361/697 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4744 event pairs, 361 based on Foata normal form. 24/696 useless extension candidates. Maximal degree in co-relation 1327. Up to 570 conditions per place. [2024-12-02 14:22:21,127 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 17 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-12-02 14:22:21,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 118 flow [2024-12-02 14:22:21,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:22:21,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 14:22:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-12-02 14:22:21,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-12-02 14:22:21,129 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 77 transitions. [2024-12-02 14:22:21,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 118 flow [2024-12-02 14:22:21,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 14:22:21,131 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2024-12-02 14:22:21,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-12-02 14:22:21,132 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-12-02 14:22:21,132 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2024-12-02 14:22:21,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:21,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:22:21,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:22:21,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 14:22:21,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 14:22:21,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:22:21,133 INFO L85 PathProgramCache]: Analyzing trace with hash 560482423, now seen corresponding path program 1 times [2024-12-02 14:22:21,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:22:21,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859845385] [2024-12-02 14:22:21,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:22:21,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:22:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:22:21,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:22:21,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:22:21,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859845385] [2024-12-02 14:22:21,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859845385] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:22:21,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:22:21,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:22:21,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509798975] [2024-12-02 14:22:21,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:22:21,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:22:21,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:22:21,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:22:21,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:22:21,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-12-02 14:22:21,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:21,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:22:21,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-12-02 14:22:21,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:22:21,972 INFO L124 PetriNetUnfolderBase]: 1047/1956 cut-off events. [2024-12-02 14:22:21,972 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 14:22:21,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3582 conditions, 1956 events. 1047/1956 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 12986 event pairs, 255 based on Foata normal form. 0/1885 useless extension candidates. Maximal degree in co-relation 3576. Up to 1012 conditions per place. [2024-12-02 14:22:21,984 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 29 selfloop transitions, 3 changer transitions 40/85 dead transitions. [2024-12-02 14:22:21,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 85 transitions, 326 flow [2024-12-02 14:22:21,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 14:22:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-12-02 14:22:21,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2024-12-02 14:22:21,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5965909090909091 [2024-12-02 14:22:21,987 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 8 states and 210 transitions. [2024-12-02 14:22:21,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 85 transitions, 326 flow [2024-12-02 14:22:21,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 325 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 14:22:21,989 INFO L231 Difference]: Finished difference. Result has 54 places, 35 transitions, 108 flow [2024-12-02 14:22:21,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=108, PETRI_PLACES=54, PETRI_TRANSITIONS=35} [2024-12-02 14:22:21,990 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2024-12-02 14:22:21,990 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 35 transitions, 108 flow [2024-12-02 14:22:21,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:21,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:22:21,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:22:21,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 14:22:21,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 14:22:21,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:22:21,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1020262390, now seen corresponding path program 1 times [2024-12-02 14:22:21,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:22:21,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960256794] [2024-12-02 14:22:21,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:22:21,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:22:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:22:22,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:22:22,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:22:22,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960256794] [2024-12-02 14:22:22,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960256794] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:22:22,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:22:22,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 14:22:22,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493319409] [2024-12-02 14:22:22,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:22:22,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 14:22:22,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:22:22,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 14:22:22,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:22:22,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-12-02 14:22:22,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 35 transitions, 108 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:22,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:22:22,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-12-02 14:22:22,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:22:23,882 INFO L124 PetriNetUnfolderBase]: 2043/3634 cut-off events. [2024-12-02 14:22:23,882 INFO L125 PetriNetUnfolderBase]: For 2302/2302 co-relation queries the response was YES. [2024-12-02 14:22:23,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8614 conditions, 3634 events. 2043/3634 cut-off events. For 2302/2302 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 25604 event pairs, 275 based on Foata normal form. 113/3740 useless extension candidates. Maximal degree in co-relation 8602. Up to 1617 conditions per place. [2024-12-02 14:22:23,904 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 43 selfloop transitions, 12 changer transitions 55/121 dead transitions. [2024-12-02 14:22:23,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 121 transitions, 636 flow [2024-12-02 14:22:23,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 14:22:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-12-02 14:22:23,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 257 transitions. [2024-12-02 14:22:23,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5840909090909091 [2024-12-02 14:22:23,907 INFO L175 Difference]: Start difference. First operand has 54 places, 35 transitions, 108 flow. Second operand 10 states and 257 transitions. [2024-12-02 14:22:23,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 121 transitions, 636 flow [2024-12-02 14:22:23,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 121 transitions, 615 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-12-02 14:22:23,933 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 247 flow [2024-12-02 14:22:23,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=247, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2024-12-02 14:22:23,934 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2024-12-02 14:22:23,934 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 247 flow [2024-12-02 14:22:23,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:23,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:22:23,934 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:22:23,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 14:22:23,934 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 14:22:23,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:22:23,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1934505525, now seen corresponding path program 1 times [2024-12-02 14:22:23,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:22:23,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170122691] [2024-12-02 14:22:23,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:22:23,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:22:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:22:24,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:22:24,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:22:24,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170122691] [2024-12-02 14:22:24,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170122691] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:22:24,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:22:24,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 14:22:24,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6990956] [2024-12-02 14:22:24,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:22:24,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 14:22:24,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:22:24,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 14:22:24,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:22:24,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-12-02 14:22:24,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 247 flow. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:24,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:22:24,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-12-02 14:22:24,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:22:25,156 INFO L124 PetriNetUnfolderBase]: 1445/2807 cut-off events. [2024-12-02 14:22:25,156 INFO L125 PetriNetUnfolderBase]: For 6760/6781 co-relation queries the response was YES. [2024-12-02 14:22:25,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9351 conditions, 2807 events. 1445/2807 cut-off events. For 6760/6781 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 20580 event pairs, 360 based on Foata normal form. 78/2789 useless extension candidates. Maximal degree in co-relation 9331. Up to 1475 conditions per place. [2024-12-02 14:22:25,183 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 29 selfloop transitions, 4 changer transitions 29/83 dead transitions. [2024-12-02 14:22:25,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 83 transitions, 555 flow [2024-12-02 14:22:25,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 14:22:25,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 14:22:25,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-12-02 14:22:25,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-12-02 14:22:25,185 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 247 flow. Second operand 7 states and 175 transitions. [2024-12-02 14:22:25,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 83 transitions, 555 flow [2024-12-02 14:22:25,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 83 transitions, 543 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-12-02 14:22:25,206 INFO L231 Difference]: Finished difference. Result has 66 places, 46 transitions, 261 flow [2024-12-02 14:22:25,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=261, PETRI_PLACES=66, PETRI_TRANSITIONS=46} [2024-12-02 14:22:25,206 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2024-12-02 14:22:25,207 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 261 flow [2024-12-02 14:22:25,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:25,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:22:25,207 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:22:25,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 14:22:25,207 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 14:22:25,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:22:25,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1084705576, now seen corresponding path program 1 times [2024-12-02 14:22:25,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:22:25,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314715374] [2024-12-02 14:22:25,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:22:25,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:22:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:22:25,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:22:25,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:22:25,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314715374] [2024-12-02 14:22:25,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314715374] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:22:25,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:22:25,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:22:25,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943364885] [2024-12-02 14:22:25,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:22:25,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:22:25,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:22:25,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:22:25,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:22:25,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-12-02 14:22:25,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 46 transitions, 261 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:25,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:22:25,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-12-02 14:22:25,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:22:25,986 INFO L124 PetriNetUnfolderBase]: 2747/4642 cut-off events. [2024-12-02 14:22:25,986 INFO L125 PetriNetUnfolderBase]: For 8356/8657 co-relation queries the response was YES. [2024-12-02 14:22:26,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14169 conditions, 4642 events. 2747/4642 cut-off events. For 8356/8657 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 30640 event pairs, 444 based on Foata normal form. 205/4677 useless extension candidates. Maximal degree in co-relation 14144. Up to 2523 conditions per place. [2024-12-02 14:22:26,025 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 51 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2024-12-02 14:22:26,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 75 transitions, 513 flow [2024-12-02 14:22:26,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 14:22:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 14:22:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-12-02 14:22:26,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6193181818181818 [2024-12-02 14:22:26,026 INFO L175 Difference]: Start difference. First operand has 66 places, 46 transitions, 261 flow. Second operand 4 states and 109 transitions. [2024-12-02 14:22:26,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 75 transitions, 513 flow [2024-12-02 14:22:26,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 485 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-12-02 14:22:26,044 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 283 flow [2024-12-02 14:22:26,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=283, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2024-12-02 14:22:26,044 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2024-12-02 14:22:26,044 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 283 flow [2024-12-02 14:22:26,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:26,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:22:26,045 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] [2024-12-02 14:22:26,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 14:22:26,045 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 14:22:26,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:22:26,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1960827456, now seen corresponding path program 1 times [2024-12-02 14:22:26,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:22:26,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491186107] [2024-12-02 14:22:26,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:22:26,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:22:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:22:26,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:22:26,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:22:26,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491186107] [2024-12-02 14:22:26,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491186107] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:22:26,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:22:26,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:22:26,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239097409] [2024-12-02 14:22:26,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:22:26,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:22:26,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:22:26,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:22:26,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:22:26,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-12-02 14:22:26,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 283 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-12-02 14:22:26,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:22:26,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-12-02 14:22:26,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:22:26,918 INFO L124 PetriNetUnfolderBase]: 2768/5123 cut-off events. [2024-12-02 14:22:26,919 INFO L125 PetriNetUnfolderBase]: For 9376/9573 co-relation queries the response was YES. [2024-12-02 14:22:26,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16879 conditions, 5123 events. 2768/5123 cut-off events. For 9376/9573 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 38652 event pairs, 900 based on Foata normal form. 151/4940 useless extension candidates. Maximal degree in co-relation 16856. Up to 1814 conditions per place. [2024-12-02 14:22:26,938 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 47 selfloop transitions, 10 changer transitions 18/94 dead transitions. [2024-12-02 14:22:26,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 94 transitions, 668 flow [2024-12-02 14:22:26,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 14:22:26,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 14:22:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2024-12-02 14:22:26,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2024-12-02 14:22:26,940 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 283 flow. Second operand 7 states and 182 transitions. [2024-12-02 14:22:26,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 94 transitions, 668 flow [2024-12-02 14:22:26,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 94 transitions, 658 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-12-02 14:22:26,946 INFO L231 Difference]: Finished difference. Result has 71 places, 54 transitions, 362 flow [2024-12-02 14:22:26,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=362, PETRI_PLACES=71, PETRI_TRANSITIONS=54} [2024-12-02 14:22:26,947 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 22 predicate places. [2024-12-02 14:22:26,947 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 54 transitions, 362 flow [2024-12-02 14:22:26,947 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-12-02 14:22:26,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:22:26,948 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] [2024-12-02 14:22:26,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 14:22:26,948 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 14:22:26,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:22:26,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1523089990, now seen corresponding path program 1 times [2024-12-02 14:22:26,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:22:26,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059724692] [2024-12-02 14:22:26,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:22:26,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:22:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:22:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:22:27,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:22:27,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059724692] [2024-12-02 14:22:27,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059724692] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:22:27,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:22:27,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 14:22:27,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343212534] [2024-12-02 14:22:27,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:22:27,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 14:22:27,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:22:27,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 14:22:27,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-12-02 14:22:27,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-12-02 14:22:27,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 54 transitions, 362 flow. Second operand has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:27,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:22:27,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-12-02 14:22:27,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:22:28,437 INFO L124 PetriNetUnfolderBase]: 3143/5863 cut-off events. [2024-12-02 14:22:28,437 INFO L125 PetriNetUnfolderBase]: For 15744/16010 co-relation queries the response was YES. [2024-12-02 14:22:28,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20534 conditions, 5863 events. 3143/5863 cut-off events. For 15744/16010 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 45925 event pairs, 1024 based on Foata normal form. 146/5677 useless extension candidates. Maximal degree in co-relation 20506. Up to 3253 conditions per place. [2024-12-02 14:22:28,460 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 47 selfloop transitions, 14 changer transitions 17/104 dead transitions. [2024-12-02 14:22:28,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 104 transitions, 794 flow [2024-12-02 14:22:28,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 14:22:28,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-12-02 14:22:28,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions. [2024-12-02 14:22:28,462 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-12-02 14:22:28,462 INFO L175 Difference]: Start difference. First operand has 71 places, 54 transitions, 362 flow. Second operand 9 states and 225 transitions. [2024-12-02 14:22:28,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 104 transitions, 794 flow [2024-12-02 14:22:28,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 104 transitions, 765 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-12-02 14:22:28,490 INFO L231 Difference]: Finished difference. Result has 83 places, 63 transitions, 493 flow [2024-12-02 14:22:28,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=493, PETRI_PLACES=83, PETRI_TRANSITIONS=63} [2024-12-02 14:22:28,491 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 34 predicate places. [2024-12-02 14:22:28,491 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 63 transitions, 493 flow [2024-12-02 14:22:28,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:28,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:22:28,491 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] [2024-12-02 14:22:28,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 14:22:28,492 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 14:22:28,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:22:28,492 INFO L85 PathProgramCache]: Analyzing trace with hash 999921068, now seen corresponding path program 2 times [2024-12-02 14:22:28,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:22:28,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331324382] [2024-12-02 14:22:28,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 14:22:28,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:22:28,518 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 14:22:28,518 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:22:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:22:28,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:22:28,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331324382] [2024-12-02 14:22:28,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331324382] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:22:28,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:22:28,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:22:28,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544794063] [2024-12-02 14:22:28,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:22:28,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:22:28,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:22:28,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:22:28,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:22:28,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-12-02 14:22:28,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 63 transitions, 493 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:28,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:22:28,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-12-02 14:22:28,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:22:29,136 INFO L124 PetriNetUnfolderBase]: 3176/5214 cut-off events. [2024-12-02 14:22:29,137 INFO L125 PetriNetUnfolderBase]: For 18781/19828 co-relation queries the response was YES. [2024-12-02 14:22:29,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19524 conditions, 5214 events. 3176/5214 cut-off events. For 18781/19828 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 33739 event pairs, 247 based on Foata normal form. 362/5343 useless extension candidates. Maximal degree in co-relation 19490. Up to 1893 conditions per place. [2024-12-02 14:22:29,152 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 63 selfloop transitions, 8 changer transitions 22/111 dead transitions. [2024-12-02 14:22:29,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 111 transitions, 1012 flow [2024-12-02 14:22:29,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:22:29,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 14:22:29,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-12-02 14:22:29,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6272727272727273 [2024-12-02 14:22:29,153 INFO L175 Difference]: Start difference. First operand has 83 places, 63 transitions, 493 flow. Second operand 5 states and 138 transitions. [2024-12-02 14:22:29,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 111 transitions, 1012 flow [2024-12-02 14:22:29,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 111 transitions, 970 flow, removed 18 selfloop flow, removed 2 redundant places. [2024-12-02 14:22:29,174 INFO L231 Difference]: Finished difference. Result has 87 places, 55 transitions, 386 flow [2024-12-02 14:22:29,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=386, PETRI_PLACES=87, PETRI_TRANSITIONS=55} [2024-12-02 14:22:29,175 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 38 predicate places. [2024-12-02 14:22:29,175 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 55 transitions, 386 flow [2024-12-02 14:22:29,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:29,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:22:29,175 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:22:29,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 14:22:29,176 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 14:22:29,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:22:29,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1178824607, now seen corresponding path program 1 times [2024-12-02 14:22:29,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:22:29,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66486733] [2024-12-02 14:22:29,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:22:29,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:22:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:22:29,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:22:29,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:22:29,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66486733] [2024-12-02 14:22:29,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66486733] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:22:29,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:22:29,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:22:29,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760532032] [2024-12-02 14:22:29,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:22:29,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:22:29,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:22:29,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:22:29,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:22:29,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-12-02 14:22:29,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 55 transitions, 386 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:29,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:22:29,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-12-02 14:22:29,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:22:29,742 INFO L124 PetriNetUnfolderBase]: 2192/3650 cut-off events. [2024-12-02 14:22:29,742 INFO L125 PetriNetUnfolderBase]: For 15253/16678 co-relation queries the response was YES. [2024-12-02 14:22:29,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14718 conditions, 3650 events. 2192/3650 cut-off events. For 15253/16678 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 23871 event pairs, 197 based on Foata normal form. 265/3714 useless extension candidates. Maximal degree in co-relation 14682. Up to 1616 conditions per place. [2024-12-02 14:22:29,753 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 57 selfloop transitions, 11 changer transitions 6/90 dead transitions. [2024-12-02 14:22:29,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 90 transitions, 740 flow [2024-12-02 14:22:29,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:22:29,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 14:22:29,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2024-12-02 14:22:29,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5795454545454546 [2024-12-02 14:22:29,754 INFO L175 Difference]: Start difference. First operand has 87 places, 55 transitions, 386 flow. Second operand 6 states and 153 transitions. [2024-12-02 14:22:29,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 90 transitions, 740 flow [2024-12-02 14:22:29,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 90 transitions, 662 flow, removed 31 selfloop flow, removed 13 redundant places. [2024-12-02 14:22:29,769 INFO L231 Difference]: Finished difference. Result has 73 places, 53 transitions, 342 flow [2024-12-02 14:22:29,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=342, PETRI_PLACES=73, PETRI_TRANSITIONS=53} [2024-12-02 14:22:29,770 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 24 predicate places. [2024-12-02 14:22:29,770 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 53 transitions, 342 flow [2024-12-02 14:22:29,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:29,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:22:29,770 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] [2024-12-02 14:22:29,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 14:22:29,770 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 14:22:29,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:22:29,771 INFO L85 PathProgramCache]: Analyzing trace with hash 826938328, now seen corresponding path program 1 times [2024-12-02 14:22:29,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:22:29,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932648012] [2024-12-02 14:22:29,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:22:29,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:22:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:22:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:22:29,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:22:29,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932648012] [2024-12-02 14:22:29,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932648012] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:22:29,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:22:29,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 14:22:29,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653552065] [2024-12-02 14:22:29,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:22:29,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:22:29,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:22:29,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:22:29,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:22:29,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-12-02 14:22:29,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 53 transitions, 342 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-12-02 14:22:29,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:22:29,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-12-02 14:22:29,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:22:30,362 INFO L124 PetriNetUnfolderBase]: 916/1930 cut-off events. [2024-12-02 14:22:30,362 INFO L125 PetriNetUnfolderBase]: For 5546/5966 co-relation queries the response was YES. [2024-12-02 14:22:30,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6652 conditions, 1930 events. 916/1930 cut-off events. For 5546/5966 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 13726 event pairs, 242 based on Foata normal form. 56/1804 useless extension candidates. Maximal degree in co-relation 6625. Up to 689 conditions per place. [2024-12-02 14:22:30,368 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 23 selfloop transitions, 1 changer transitions 41/89 dead transitions. [2024-12-02 14:22:30,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 89 transitions, 671 flow [2024-12-02 14:22:30,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:22:30,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 14:22:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-12-02 14:22:30,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-12-02 14:22:30,370 INFO L175 Difference]: Start difference. First operand has 73 places, 53 transitions, 342 flow. Second operand 6 states and 150 transitions. [2024-12-02 14:22:30,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 89 transitions, 671 flow [2024-12-02 14:22:30,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 89 transitions, 557 flow, removed 47 selfloop flow, removed 8 redundant places. [2024-12-02 14:22:30,383 INFO L231 Difference]: Finished difference. Result has 74 places, 45 transitions, 234 flow [2024-12-02 14:22:30,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=74, PETRI_TRANSITIONS=45} [2024-12-02 14:22:30,384 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 25 predicate places. [2024-12-02 14:22:30,384 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 45 transitions, 234 flow [2024-12-02 14:22:30,385 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-12-02 14:22:30,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:22:30,385 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] [2024-12-02 14:22:30,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 14:22:30,385 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 14:22:30,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:22:30,385 INFO L85 PathProgramCache]: Analyzing trace with hash -967141076, now seen corresponding path program 2 times [2024-12-02 14:22:30,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:22:30,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055614606] [2024-12-02 14:22:30,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 14:22:30,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:22:30,433 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 14:22:30,433 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:22:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:22:31,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:22:31,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055614606] [2024-12-02 14:22:31,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055614606] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:22:31,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:22:31,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 14:22:31,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144724456] [2024-12-02 14:22:31,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:22:31,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 14:22:31,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:22:31,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 14:22:31,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-12-02 14:22:31,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-12-02 14:22:31,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 45 transitions, 234 flow. Second operand has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:31,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:22:31,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-12-02 14:22:31,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:22:32,075 INFO L124 PetriNetUnfolderBase]: 509/1084 cut-off events. [2024-12-02 14:22:32,076 INFO L125 PetriNetUnfolderBase]: For 1429/1537 co-relation queries the response was YES. [2024-12-02 14:22:32,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3052 conditions, 1084 events. 509/1084 cut-off events. For 1429/1537 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 6582 event pairs, 129 based on Foata normal form. 22/1011 useless extension candidates. Maximal degree in co-relation 3027. Up to 413 conditions per place. [2024-12-02 14:22:32,079 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 22 selfloop transitions, 7 changer transitions 34/83 dead transitions. [2024-12-02 14:22:32,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 83 transitions, 500 flow [2024-12-02 14:22:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 14:22:32,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-12-02 14:22:32,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 227 transitions. [2024-12-02 14:22:32,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4690082644628099 [2024-12-02 14:22:32,081 INFO L175 Difference]: Start difference. First operand has 74 places, 45 transitions, 234 flow. Second operand 11 states and 227 transitions. [2024-12-02 14:22:32,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 83 transitions, 500 flow [2024-12-02 14:22:32,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 463 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-12-02 14:22:32,085 INFO L231 Difference]: Finished difference. Result has 74 places, 42 transitions, 219 flow [2024-12-02 14:22:32,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=61, 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=11, PETRI_FLOW=219, PETRI_PLACES=74, PETRI_TRANSITIONS=42} [2024-12-02 14:22:32,085 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 25 predicate places. [2024-12-02 14:22:32,085 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 42 transitions, 219 flow [2024-12-02 14:22:32,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:32,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:22:32,085 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] [2024-12-02 14:22:32,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 14:22:32,086 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 14:22:32,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:22:32,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1583802696, now seen corresponding path program 3 times [2024-12-02 14:22:32,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:22:32,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492476921] [2024-12-02 14:22:32,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 14:22:32,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:22:32,130 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-12-02 14:22:32,130 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-12-02 14:22:32,130 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 14:22:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 14:22:32,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 14:22:32,211 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 14:22:32,212 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-12-02 14:22:32,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-12-02 14:22:32,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-12-02 14:22:32,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-12-02 14:22:32,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-12-02 14:22:32,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-12-02 14:22:32,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-12-02 14:22:32,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 14:22:32,215 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:22:32,266 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-12-02 14:22:32,267 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 14:22:32,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:22:32 BasicIcfg [2024-12-02 14:22:32,271 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 14:22:32,272 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 14:22:32,272 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 14:22:32,272 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 14:22:32,272 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:22:19" (3/4) ... [2024-12-02 14:22:32,274 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-12-02 14:22:32,275 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 14:22:32,276 INFO L158 Benchmark]: Toolchain (without parser) took 13363.08ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 116.2MB in the beginning and 259.2MB in the end (delta: -143.0MB). Peak memory consumption was 402.1MB. Max. memory is 16.1GB. [2024-12-02 14:22:32,276 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 142.6MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:22:32,276 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.38ms. Allocated memory is still 142.6MB. Free memory was 116.2MB in the beginning and 93.5MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 14:22:32,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.87ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:22:32,276 INFO L158 Benchmark]: Boogie Preprocessor took 40.34ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 88.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:22:32,277 INFO L158 Benchmark]: RCFGBuilder took 598.12ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 100.1MB in the end (delta: -12.3MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2024-12-02 14:22:32,277 INFO L158 Benchmark]: TraceAbstraction took 12272.26ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 99.4MB in the beginning and 259.3MB in the end (delta: -159.9MB). Peak memory consumption was 387.8MB. Max. memory is 16.1GB. [2024-12-02 14:22:32,277 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 687.9MB. Free memory was 259.3MB in the beginning and 259.2MB in the end (delta: 61.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:22:32,279 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.26ms. Allocated memory is still 142.6MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.38ms. Allocated memory is still 142.6MB. Free memory was 116.2MB in the beginning and 93.5MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.87ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.34ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 88.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 598.12ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 100.1MB in the end (delta: -12.3MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. * TraceAbstraction took 12272.26ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 99.4MB in the beginning and 259.3MB in the end (delta: -159.9MB). Peak memory consumption was 387.8MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 687.9MB. Free memory was 259.3MB in the beginning and 259.2MB in the end (delta: 61.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1492; [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t1493; [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492=-1, t1493=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t1494; [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492=-1, t1493=0, t1494=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L741] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L759] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=-1, t1493=0, t1494=1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=-1, t1493=0, t1494=1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=-1, t1493=0, t1494=1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L17] 0 __assert_fail ("0", "mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 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: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 507 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 479 mSDsluCounter, 226 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 181 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1538 IncrementalHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 45 mSDtfsCounter, 1538 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=493occurred in iteration=8, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 1705 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-12-02 14:22:32,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 14:22:34,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 14:22:34,331 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-12-02 14:22:34,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 14:22:34,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 14:22:34,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 14:22:34,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 14:22:34,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 14:22:34,362 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 14:22:34,362 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 14:22:34,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 14:22:34,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 14:22:34,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 14:22:34,362 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 14:22:34,362 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 14:22:34,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 14:22:34,363 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 14:22:34,363 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 14:22:34,363 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 14:22:34,363 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 14:22:34,363 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-02 14:22:34,363 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-02 14:22:34,363 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-02 14:22:34,363 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 14:22:34,363 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 14:22:34,363 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-12-02 14:22:34,364 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-12-02 14:22:34,364 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 14:22:34,364 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 14:22:34,364 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 14:22:34,364 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 14:22:34,364 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 14:22:34,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:22:34,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:22:34,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:22:34,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:22:34,364 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 14:22:34,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:22:34,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:22:34,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:22:34,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:22:34,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 14:22:34,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 14:22:34,365 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-12-02 14:22:34,365 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-12-02 14:22:34,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 14:22:34,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 14:22:34,365 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 14:22:34,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 14:22:34,365 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_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 [2024-12-02 14:22:34,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 14:22:34,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 14:22:34,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 14:22:34,607 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 14:22:34,608 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 14:22:34,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-12-02 14:22:37,230 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/data/f4547b6a4/0ca92d86f9ef4253a44daeb2899116c3/FLAG0f66df201 [2024-12-02 14:22:37,501 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 14:22:37,502 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-12-02 14:22:37,514 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/data/f4547b6a4/0ca92d86f9ef4253a44daeb2899116c3/FLAG0f66df201 [2024-12-02 14:22:37,528 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/data/f4547b6a4/0ca92d86f9ef4253a44daeb2899116c3 [2024-12-02 14:22:37,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 14:22:37,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 14:22:37,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 14:22:37,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 14:22:37,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 14:22:37,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:22:37" (1/1) ... [2024-12-02 14:22:37,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@249779ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:37, skipping insertion in model container [2024-12-02 14:22:37,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:22:37" (1/1) ... [2024-12-02 14:22:37,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 14:22:37,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:22:37,865 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 14:22:37,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:22:37,944 INFO L204 MainTranslator]: Completed translation [2024-12-02 14:22:37,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:37 WrapperNode [2024-12-02 14:22:37,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 14:22:37,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 14:22:37,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 14:22:37,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 14:22:37,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:37" (1/1) ... [2024-12-02 14:22:37,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:37" (1/1) ... [2024-12-02 14:22:37,987 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-12-02 14:22:37,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 14:22:37,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 14:22:37,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 14:22:37,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 14:22:37,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:37" (1/1) ... [2024-12-02 14:22:37,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:37" (1/1) ... [2024-12-02 14:22:38,000 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:37" (1/1) ... [2024-12-02 14:22:38,015 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-12-02 14:22:38,015 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:37" (1/1) ... [2024-12-02 14:22:38,015 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:37" (1/1) ... [2024-12-02 14:22:38,023 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:37" (1/1) ... [2024-12-02 14:22:38,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:37" (1/1) ... [2024-12-02 14:22:38,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:37" (1/1) ... [2024-12-02 14:22:38,028 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:37" (1/1) ... [2024-12-02 14:22:38,029 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:37" (1/1) ... [2024-12-02 14:22:38,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 14:22:38,033 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 14:22:38,033 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 14:22:38,033 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 14:22:38,034 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:37" (1/1) ... [2024-12-02 14:22:38,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:22:38,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:22:38,068 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 14:22:38,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 14:22:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-12-02 14:22:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 14:22:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-12-02 14:22:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-12-02 14:22:38,094 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-12-02 14:22:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-12-02 14:22:38,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-12-02 14:22:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-12-02 14:22:38,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-12-02 14:22:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-12-02 14:22:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 14:22:38,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 14:22:38,096 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-02 14:22:38,227 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 14:22:38,229 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 14:22:38,510 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-02 14:22:38,510 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 14:22:38,717 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 14:22:38,717 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 14:22:38,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:22:38 BoogieIcfgContainer [2024-12-02 14:22:38,717 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 14:22:38,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 14:22:38,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 14:22:38,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 14:22:38,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:22:37" (1/3) ... [2024-12-02 14:22:38,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f7bcbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:22:38, skipping insertion in model container [2024-12-02 14:22:38,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:37" (2/3) ... [2024-12-02 14:22:38,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f7bcbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:22:38, skipping insertion in model container [2024-12-02 14:22:38,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:22:38" (3/3) ... [2024-12-02 14:22:38,727 INFO L128 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-12-02 14:22:38,741 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 14:22:38,742 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-12-02 14:22:38,743 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-02 14:22:38,799 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-12-02 14:22:38,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-12-02 14:22:38,872 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-12-02 14:22:38,874 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 14:22:38,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-12-02 14:22:38,877 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-12-02 14:22:38,880 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-12-02 14:22:38,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 14:22:38,896 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;@6342373c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 14:22:38,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-12-02 14:22:38,903 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 14:22:38,903 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-12-02 14:22:38,903 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 14:22:38,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:22:38,904 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:22:38,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 14:22:38,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:22:38,910 INFO L85 PathProgramCache]: Analyzing trace with hash 368939028, now seen corresponding path program 1 times [2024-12-02 14:22:38,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:22:38,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1454711659] [2024-12-02 14:22:38,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:22:38,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:22:38,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:22:38,921 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:22:38,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 14:22:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:22:39,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 14:22:39,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:22:39,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:22:39,069 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:22:39,069 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:22:39,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454711659] [2024-12-02 14:22:39,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454711659] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:22:39,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:22:39,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 14:22:39,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686609123] [2024-12-02 14:22:39,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:22:39,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:22:39,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:22:39,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:22:39,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:22:39,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 44 [2024-12-02 14:22:39,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:39,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:22:39,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 44 [2024-12-02 14:22:39,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:22:39,377 INFO L124 PetriNetUnfolderBase]: 407/797 cut-off events. [2024-12-02 14:22:39,378 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 14:22:39,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1460 conditions, 797 events. 407/797 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5335 event pairs, 74 based on Foata normal form. 48/832 useless extension candidates. Maximal degree in co-relation 1449. Up to 496 conditions per place. [2024-12-02 14:22:39,387 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 27 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2024-12-02 14:22:39,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 167 flow [2024-12-02 14:22:39,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:22:39,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 14:22:39,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-12-02 14:22:39,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2024-12-02 14:22:39,402 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 96 transitions. [2024-12-02 14:22:39,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 167 flow [2024-12-02 14:22:39,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 14:22:39,409 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-12-02 14:22:39,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-12-02 14:22:39,416 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-12-02 14:22:39,416 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-12-02 14:22:39,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:39,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:22:39,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:22:39,426 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 14:22:39,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:22:39,617 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 14:22:39,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:22:39,618 INFO L85 PathProgramCache]: Analyzing trace with hash -46216889, now seen corresponding path program 1 times [2024-12-02 14:22:39,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:22:39,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [215058569] [2024-12-02 14:22:39,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:22:39,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:22:39,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:22:39,621 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:22:39,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 14:22:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:22:39,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-12-02 14:22:39,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:22:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:22:39,753 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:22:39,753 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:22:39,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215058569] [2024-12-02 14:22:39,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215058569] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:22:39,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:22:39,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 14:22:39,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025473514] [2024-12-02 14:22:39,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:22:39,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:22:39,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:22:39,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:22:39,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:22:39,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-12-02 14:22:39,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:39,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:22:39,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-12-02 14:22:39,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:22:39,894 INFO L124 PetriNetUnfolderBase]: 361/697 cut-off events. [2024-12-02 14:22:39,894 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-12-02 14:22:39,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 697 events. 361/697 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4773 event pairs, 361 based on Foata normal form. 24/696 useless extension candidates. Maximal degree in co-relation 1327. Up to 570 conditions per place. [2024-12-02 14:22:39,900 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 17 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-12-02 14:22:39,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 118 flow [2024-12-02 14:22:39,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:22:39,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 14:22:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-12-02 14:22:39,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-12-02 14:22:39,902 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 77 transitions. [2024-12-02 14:22:39,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 118 flow [2024-12-02 14:22:39,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 14:22:39,904 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2024-12-02 14:22:39,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-12-02 14:22:39,905 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-12-02 14:22:39,905 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2024-12-02 14:22:39,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:39,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:22:39,905 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:22:39,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-12-02 14:22:40,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:22:40,106 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 14:22:40,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:22:40,107 INFO L85 PathProgramCache]: Analyzing trace with hash -46215495, now seen corresponding path program 1 times [2024-12-02 14:22:40,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:22:40,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [513707648] [2024-12-02 14:22:40,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:22:40,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:22:40,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:22:40,111 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:22:40,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 14:22:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:22:40,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 14:22:40,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:22:40,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:22:40,245 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:22:40,245 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:22:40,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513707648] [2024-12-02 14:22:40,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513707648] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:22:40,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:22:40,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:22:40,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71186989] [2024-12-02 14:22:40,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:22:40,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:22:40,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:22:40,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:22:40,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:22:40,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-12-02 14:22:40,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:40,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:22:40,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-12-02 14:22:40,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:22:40,501 INFO L124 PetriNetUnfolderBase]: 1014/1722 cut-off events. [2024-12-02 14:22:40,501 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 14:22:40,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3307 conditions, 1722 events. 1014/1722 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 10545 event pairs, 94 based on Foata normal form. 60/1773 useless extension candidates. Maximal degree in co-relation 3301. Up to 1015 conditions per place. [2024-12-02 14:22:40,507 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 37 selfloop transitions, 5 changer transitions 1/55 dead transitions. [2024-12-02 14:22:40,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 208 flow [2024-12-02 14:22:40,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 14:22:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 14:22:40,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-12-02 14:22:40,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6193181818181818 [2024-12-02 14:22:40,509 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 4 states and 109 transitions. [2024-12-02 14:22:40,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 208 flow [2024-12-02 14:22:40,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 207 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 14:22:40,511 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 109 flow [2024-12-02 14:22:40,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-12-02 14:22:40,512 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2024-12-02 14:22:40,512 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 109 flow [2024-12-02 14:22:40,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:40,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:22:40,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:22:40,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 14:22:40,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:22:40,713 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 14:22:40,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:22:40,713 INFO L85 PathProgramCache]: Analyzing trace with hash -142859324, now seen corresponding path program 1 times [2024-12-02 14:22:40,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:22:40,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1148138041] [2024-12-02 14:22:40,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:22:40,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:22:40,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:22:40,715 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:22:40,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 14:22:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:22:40,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 14:22:40,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:22:40,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:22:40,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:22:40,846 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:22:40,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148138041] [2024-12-02 14:22:40,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148138041] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:22:40,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:22:40,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:22:40,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013004380] [2024-12-02 14:22:40,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:22:40,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:22:40,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:22:40,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:22:40,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:22:40,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-12-02 14:22:40,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:40,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:22:40,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-12-02 14:22:40,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:22:41,077 INFO L124 PetriNetUnfolderBase]: 688/1192 cut-off events. [2024-12-02 14:22:41,077 INFO L125 PetriNetUnfolderBase]: For 321/321 co-relation queries the response was YES. [2024-12-02 14:22:41,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2736 conditions, 1192 events. 688/1192 cut-off events. For 321/321 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6461 event pairs, 34 based on Foata normal form. 54/1237 useless extension candidates. Maximal degree in co-relation 2727. Up to 553 conditions per place. [2024-12-02 14:22:41,082 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 46 selfloop transitions, 8 changer transitions 1/67 dead transitions. [2024-12-02 14:22:41,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 300 flow [2024-12-02 14:22:41,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:22:41,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 14:22:41,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-12-02 14:22:41,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-12-02 14:22:41,084 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 109 flow. Second operand 5 states and 137 transitions. [2024-12-02 14:22:41,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 300 flow [2024-12-02 14:22:41,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 67 transitions, 290 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-12-02 14:22:41,086 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 149 flow [2024-12-02 14:22:41,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2024-12-02 14:22:41,087 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2024-12-02 14:22:41,087 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 149 flow [2024-12-02 14:22:41,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:41,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:22:41,088 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-12-02 14:22:41,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 14:22:41,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:22:41,288 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 14:22:41,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:22:41,289 INFO L85 PathProgramCache]: Analyzing trace with hash -585713829, now seen corresponding path program 1 times [2024-12-02 14:22:41,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:22:41,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1690749064] [2024-12-02 14:22:41,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:22:41,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:22:41,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:22:41,291 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:22:41,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 14:22:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:22:41,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 14:22:41,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:22:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:22:41,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:22:41,445 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:22:41,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690749064] [2024-12-02 14:22:41,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690749064] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:22:41,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:22:41,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:22:41,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514935707] [2024-12-02 14:22:41,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:22:41,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:22:41,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:22:41,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:22:41,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:22:41,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-12-02 14:22:41,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:41,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:22:41,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-12-02 14:22:41,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:22:41,697 INFO L124 PetriNetUnfolderBase]: 369/635 cut-off events. [2024-12-02 14:22:41,697 INFO L125 PetriNetUnfolderBase]: For 571/571 co-relation queries the response was YES. [2024-12-02 14:22:41,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1694 conditions, 635 events. 369/635 cut-off events. For 571/571 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2711 event pairs, 23 based on Foata normal form. 32/658 useless extension candidates. Maximal degree in co-relation 1683. Up to 228 conditions per place. [2024-12-02 14:22:41,700 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 41 selfloop transitions, 11 changer transitions 1/65 dead transitions. [2024-12-02 14:22:41,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 65 transitions, 315 flow [2024-12-02 14:22:41,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:22:41,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 14:22:41,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-12-02 14:22:41,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.571969696969697 [2024-12-02 14:22:41,702 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 149 flow. Second operand 6 states and 151 transitions. [2024-12-02 14:22:41,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 65 transitions, 315 flow [2024-12-02 14:22:41,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 290 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-12-02 14:22:41,706 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 163 flow [2024-12-02 14:22:41,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2024-12-02 14:22:41,707 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2024-12-02 14:22:41,707 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 163 flow [2024-12-02 14:22:41,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:41,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:22:41,708 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] [2024-12-02 14:22:41,717 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 14:22:41,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:22:41,912 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 14:22:41,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:22:41,913 INFO L85 PathProgramCache]: Analyzing trace with hash 219099540, now seen corresponding path program 1 times [2024-12-02 14:22:41,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:22:41,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [723985353] [2024-12-02 14:22:41,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:22:41,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:22:41,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:22:41,915 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:22:41,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 14:22:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:22:41,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-12-02 14:22:41,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:22:42,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:22:42,203 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:22:42,203 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:22:42,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723985353] [2024-12-02 14:22:42,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723985353] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:22:42,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:22:42,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 14:22:42,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980608678] [2024-12-02 14:22:42,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:22:42,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 14:22:42,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:22:42,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 14:22:42,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-12-02 14:22:42,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-12-02 14:22:42,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 163 flow. Second operand has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:42,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:22:42,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-12-02 14:22:42,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:22:42,654 INFO L124 PetriNetUnfolderBase]: 699/1178 cut-off events. [2024-12-02 14:22:42,654 INFO L125 PetriNetUnfolderBase]: For 1133/1137 co-relation queries the response was YES. [2024-12-02 14:22:42,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3168 conditions, 1178 events. 699/1178 cut-off events. For 1133/1137 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5499 event pairs, 175 based on Foata normal form. 12/1185 useless extension candidates. Maximal degree in co-relation 3156. Up to 665 conditions per place. [2024-12-02 14:22:42,658 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 43 selfloop transitions, 7 changer transitions 33/93 dead transitions. [2024-12-02 14:22:42,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 93 transitions, 527 flow [2024-12-02 14:22:42,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 14:22:42,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-12-02 14:22:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 204 transitions. [2024-12-02 14:22:42,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2024-12-02 14:22:42,660 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 163 flow. Second operand 9 states and 204 transitions. [2024-12-02 14:22:42,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 93 transitions, 527 flow [2024-12-02 14:22:42,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 93 transitions, 410 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-12-02 14:22:42,667 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 151 flow [2024-12-02 14:22:42,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=151, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2024-12-02 14:22:42,668 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2024-12-02 14:22:42,668 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 151 flow [2024-12-02 14:22:42,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:42,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:22:42,668 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] [2024-12-02 14:22:42,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 14:22:42,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:22:42,869 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 14:22:42,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:22:42,869 INFO L85 PathProgramCache]: Analyzing trace with hash -45507362, now seen corresponding path program 2 times [2024-12-02 14:22:42,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:22:42,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1358276857] [2024-12-02 14:22:42,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 14:22:42,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:22:42,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:22:42,871 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:22:42,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 14:22:42,947 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 14:22:42,947 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:22:42,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-02 14:22:42,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:22:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:22:43,022 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:22:43,022 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:22:43,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358276857] [2024-12-02 14:22:43,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358276857] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:22:43,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:22:43,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 14:22:43,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351389488] [2024-12-02 14:22:43,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:22:43,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:22:43,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:22:43,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:22:43,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:22:43,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-12-02 14:22:43,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:43,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:22:43,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-12-02 14:22:43,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:22:43,302 INFO L124 PetriNetUnfolderBase]: 607/1198 cut-off events. [2024-12-02 14:22:43,302 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2024-12-02 14:22:43,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2511 conditions, 1198 events. 607/1198 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6834 event pairs, 252 based on Foata normal form. 8/1126 useless extension candidates. Maximal degree in co-relation 2497. Up to 493 conditions per place. [2024-12-02 14:22:43,308 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 29 selfloop transitions, 2 changer transitions 17/69 dead transitions. [2024-12-02 14:22:43,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 308 flow [2024-12-02 14:22:43,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:22:43,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 14:22:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-12-02 14:22:43,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-12-02 14:22:43,309 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 151 flow. Second operand 6 states and 150 transitions. [2024-12-02 14:22:43,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 308 flow [2024-12-02 14:22:43,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 282 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-12-02 14:22:43,312 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 144 flow [2024-12-02 14:22:43,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2024-12-02 14:22:43,313 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2024-12-02 14:22:43,313 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 144 flow [2024-12-02 14:22:43,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:43,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:22:43,313 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] [2024-12-02 14:22:43,322 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 14:22:43,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:22:43,514 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 14:22:43,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:22:43,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1800334314, now seen corresponding path program 3 times [2024-12-02 14:22:43,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:22:43,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1765672759] [2024-12-02 14:22:43,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 14:22:43,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:22:43,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:22:43,517 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:22:43,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 14:22:43,602 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-12-02 14:22:43,602 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-12-02 14:22:43,602 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 14:22:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 14:22:43,675 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-12-02 14:22:43,675 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 14:22:43,676 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-12-02 14:22:43,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-12-02 14:22:43,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-12-02 14:22:43,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-12-02 14:22:43,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-12-02 14:22:43,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-12-02 14:22:43,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-12-02 14:22:43,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 14:22:43,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:22:43,879 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2024-12-02 14:22:43,934 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-12-02 14:22:43,934 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 14:22:43,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:22:43 BasicIcfg [2024-12-02 14:22:43,939 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 14:22:43,940 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 14:22:43,940 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 14:22:43,940 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 14:22:43,941 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:22:38" (3/4) ... [2024-12-02 14:22:43,942 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-12-02 14:22:43,942 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 14:22:43,943 INFO L158 Benchmark]: Toolchain (without parser) took 6412.05ms. Allocated memory was 92.3MB in the beginning and 142.6MB in the end (delta: 50.3MB). Free memory was 68.1MB in the beginning and 40.3MB in the end (delta: 27.8MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. [2024-12-02 14:22:43,943 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 83.9MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:22:43,944 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.73ms. Allocated memory is still 92.3MB. Free memory was 68.0MB in the beginning and 45.0MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 14:22:43,944 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.04ms. Allocated memory is still 92.3MB. Free memory was 44.9MB in the beginning and 42.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:22:43,944 INFO L158 Benchmark]: Boogie Preprocessor took 44.21ms. Allocated memory is still 92.3MB. Free memory was 42.4MB in the beginning and 39.6MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:22:43,944 INFO L158 Benchmark]: RCFGBuilder took 684.23ms. Allocated memory is still 92.3MB. Free memory was 39.6MB in the beginning and 38.2MB in the end (delta: 1.4MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-12-02 14:22:43,945 INFO L158 Benchmark]: TraceAbstraction took 5219.98ms. Allocated memory was 92.3MB in the beginning and 142.6MB in the end (delta: 50.3MB). Free memory was 37.7MB in the beginning and 40.3MB in the end (delta: -2.6MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2024-12-02 14:22:43,945 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 142.6MB. Free memory was 40.3MB in the beginning and 40.3MB in the end (delta: 17.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:22:43,947 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.25ms. Allocated memory is still 83.9MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.73ms. Allocated memory is still 92.3MB. Free memory was 68.0MB in the beginning and 45.0MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.04ms. Allocated memory is still 92.3MB. Free memory was 44.9MB in the beginning and 42.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.21ms. Allocated memory is still 92.3MB. Free memory was 42.4MB in the beginning and 39.6MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 684.23ms. Allocated memory is still 92.3MB. Free memory was 39.6MB in the beginning and 38.2MB in the end (delta: 1.4MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5219.98ms. Allocated memory was 92.3MB in the beginning and 142.6MB in the end (delta: 50.3MB). Free memory was 37.7MB in the beginning and 40.3MB in the end (delta: -2.6MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 142.6MB. Free memory was 40.3MB in the beginning and 40.3MB in the end (delta: 17.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1492; [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t1493; [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492=-2, t1493=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t1494; [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492=-2, t1493=-1, t1494=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L741] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L759] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=-2, t1493=-1, t1494=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=-2, t1493=-1, t1494=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=-2, t1493=-1, t1494=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L17] 0 __assert_fail ("0", "mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 818]: 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, 68 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: 5.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 272 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 914 IncrementalHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 26 mSDtfsCounter, 914 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=5, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 173 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 410 SizeOfPredicates, 17 NumberOfNonLiveVariables, 701 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-12-02 14:22:43,962 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ed6b13-a7aa-4c63-8585-2e2969f44437/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample