./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 62286332e049ab35f6bf4022df54bae198ba0ceaf820c98713e2f1f442f473b5 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 19:55:29,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 19:55:29,403 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-27 19:55:29,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 19:55:29,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 19:55:29,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 19:55:29,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 19:55:29,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 19:55:29,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 19:55:29,437 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 19:55:29,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 19:55:29,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 19:55:29,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 19:55:29,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 19:55:29,438 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 19:55:29,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 19:55:29,438 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 19:55:29,438 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 19:55:29,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 19:55:29,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 19:55:29,439 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 19:55:29,439 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 19:55:29,439 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 19:55:29,439 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 19:55:29,439 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 19:55:29,439 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 19:55:29,440 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 19:55:29,440 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 19:55:29,440 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 19:55:29,440 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 19:55:29,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:55:29,440 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:55:29,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:55:29,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:55:29,440 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 19:55:29,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:55:29,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:55:29,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:55:29,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:55:29,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 19:55:29,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 19:55:29,441 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 19:55:29,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 19:55:29,442 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 19:55:29,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 19:55:29,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 19:55:29,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 19:55:29,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_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 62286332e049ab35f6bf4022df54bae198ba0ceaf820c98713e2f1f442f473b5 [2024-11-27 19:55:29,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 19:55:29,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 19:55:29,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 19:55:29,776 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 19:55:29,776 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 19:55:29,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/mix000.oepc.i [2024-11-27 19:55:32,809 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/data/9b6482a59/c7306e7f3e5d4dba98415ec1d173134a/FLAGb243dd2e0 [2024-11-27 19:55:33,154 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 19:55:33,155 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/sv-benchmarks/c/pthread-wmm/mix000.oepc.i [2024-11-27 19:55:33,171 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/data/9b6482a59/c7306e7f3e5d4dba98415ec1d173134a/FLAGb243dd2e0 [2024-11-27 19:55:33,370 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/data/9b6482a59/c7306e7f3e5d4dba98415ec1d173134a [2024-11-27 19:55:33,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 19:55:33,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 19:55:33,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 19:55:33,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 19:55:33,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 19:55:33,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:55:33" (1/1) ... [2024-11-27 19:55:33,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77717ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:33, skipping insertion in model container [2024-11-27 19:55:33,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:55:33" (1/1) ... [2024-11-27 19:55:33,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 19:55:33,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:55:33,817 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 19:55:33,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:55:33,916 INFO L204 MainTranslator]: Completed translation [2024-11-27 19:55:33,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:33 WrapperNode [2024-11-27 19:55:33,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 19:55:33,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 19:55:33,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 19:55:33,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 19:55:33,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:33" (1/1) ... [2024-11-27 19:55:33,939 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:33" (1/1) ... [2024-11-27 19:55:33,964 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 132 [2024-11-27 19:55:33,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 19:55:33,965 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 19:55:33,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 19:55:33,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 19:55:33,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:33" (1/1) ... [2024-11-27 19:55:33,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:33" (1/1) ... [2024-11-27 19:55:33,981 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:33" (1/1) ... [2024-11-27 19:55:33,997 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-27 19:55:33,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:33" (1/1) ... [2024-11-27 19:55:33,998 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:33" (1/1) ... [2024-11-27 19:55:34,004 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:33" (1/1) ... [2024-11-27 19:55:34,006 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:33" (1/1) ... [2024-11-27 19:55:34,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:33" (1/1) ... [2024-11-27 19:55:34,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:33" (1/1) ... [2024-11-27 19:55:34,011 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:33" (1/1) ... [2024-11-27 19:55:34,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 19:55:34,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 19:55:34,021 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 19:55:34,021 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 19:55:34,022 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:33" (1/1) ... [2024-11-27 19:55:34,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:55:34,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:55:34,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 19:55:34,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 19:55:34,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-27 19:55:34,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 19:55:34,090 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-27 19:55:34,090 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-27 19:55:34,091 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-27 19:55:34,091 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-27 19:55:34,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 19:55:34,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-27 19:55:34,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 19:55:34,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 19:55:34,093 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-27 19:55:34,261 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 19:55:34,264 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 19:55:34,663 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-27 19:55:34,663 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 19:55:34,981 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 19:55:34,985 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 19:55:34,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:55:34 BoogieIcfgContainer [2024-11-27 19:55:34,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 19:55:34,987 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 19:55:34,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 19:55:34,995 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 19:55:34,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 07:55:33" (1/3) ... [2024-11-27 19:55:34,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a0576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:55:34, skipping insertion in model container [2024-11-27 19:55:34,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:33" (2/3) ... [2024-11-27 19:55:34,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a0576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:55:34, skipping insertion in model container [2024-11-27 19:55:34,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:55:34" (3/3) ... [2024-11-27 19:55:34,999 INFO L128 eAbstractionObserver]: Analyzing ICFG mix000.oepc.i [2024-11-27 19:55:35,016 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 19:55:35,020 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix000.oepc.i that has 3 procedures, 36 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-27 19:55:35,021 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-27 19:55:35,094 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-27 19:55:35,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 82 flow [2024-11-27 19:55:35,189 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-11-27 19:55:35,193 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 19:55:35,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 2/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2024-11-27 19:55:35,198 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 82 flow [2024-11-27 19:55:35,203 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 35 transitions, 76 flow [2024-11-27 19:55:35,216 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 19:55:35,233 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;@753838a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 19:55:35,233 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-27 19:55:35,240 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 19:55:35,242 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-27 19:55:35,242 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 19:55:35,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:55:35,244 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-27 19:55:35,244 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-27 19:55:35,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:55:35,252 INFO L85 PathProgramCache]: Analyzing trace with hash 12053908, now seen corresponding path program 1 times [2024-11-27 19:55:35,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:55:35,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39897031] [2024-11-27 19:55:35,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:55:35,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:55:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:55:35,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:55:35,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:55:35,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39897031] [2024-11-27 19:55:35,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39897031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:55:35,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:55:35,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 19:55:35,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294232265] [2024-11-27 19:55:35,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:55:35,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:55:35,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:55:35,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:55:35,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:55:35,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-11-27 19:55:35,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:55:35,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:55:35,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-11-27 19:55:35,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:55:36,306 INFO L124 PetriNetUnfolderBase]: 237/502 cut-off events. [2024-11-27 19:55:36,306 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-27 19:55:36,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 502 events. 237/502 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2777 event pairs, 21 based on Foata normal form. 40/537 useless extension candidates. Maximal degree in co-relation 916. Up to 353 conditions per place. [2024-11-27 19:55:36,319 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 26 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2024-11-27 19:55:36,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 155 flow [2024-11-27 19:55:36,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:55:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:55:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-27 19:55:36,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7207207207207207 [2024-11-27 19:55:36,342 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 76 flow. Second operand 3 states and 80 transitions. [2024-11-27 19:55:36,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 155 flow [2024-11-27 19:55:36,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 19:55:36,353 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 68 flow [2024-11-27 19:55:36,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-11-27 19:55:36,362 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2024-11-27 19:55:36,362 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 68 flow [2024-11-27 19:55:36,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:55:36,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:55:36,363 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:55:36,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 19:55:36,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-27 19:55:36,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:55:36,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1311800578, now seen corresponding path program 1 times [2024-11-27 19:55:36,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:55:36,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815073577] [2024-11-27 19:55:36,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:55:36,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:55:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:55:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:55:36,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:55:36,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815073577] [2024-11-27 19:55:36,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815073577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:55:36,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:55:36,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 19:55:36,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217123956] [2024-11-27 19:55:36,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:55:36,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:55:36,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:55:36,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:55:36,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:55:36,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-11-27 19:55:36,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:55:36,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:55:36,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-11-27 19:55:36,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:55:36,733 INFO L124 PetriNetUnfolderBase]: 206/472 cut-off events. [2024-11-27 19:55:36,733 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-27 19:55:36,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 472 events. 206/472 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2604 event pairs, 206 based on Foata normal form. 20/473 useless extension candidates. Maximal degree in co-relation 865. Up to 357 conditions per place. [2024-11-27 19:55:36,738 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 15 selfloop transitions, 1 changer transitions 1/29 dead transitions. [2024-11-27 19:55:36,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 100 flow [2024-11-27 19:55:36,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:55:36,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:55:36,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-11-27 19:55:36,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2024-11-27 19:55:36,740 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 68 flow. Second operand 3 states and 60 transitions. [2024-11-27 19:55:36,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 100 flow [2024-11-27 19:55:36,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 19:55:36,742 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2024-11-27 19:55:36,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2024-11-27 19:55:36,742 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2024-11-27 19:55:36,743 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2024-11-27 19:55:36,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:55:36,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:55:36,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:55:36,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 19:55:36,743 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-27 19:55:36,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:55:36,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1311800501, now seen corresponding path program 1 times [2024-11-27 19:55:36,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:55:36,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208721417] [2024-11-27 19:55:36,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:55:36,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:55:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:55:37,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:55:37,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:55:37,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208721417] [2024-11-27 19:55:37,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208721417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:55:37,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:55:37,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:55:37,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897621435] [2024-11-27 19:55:37,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:55:37,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:55:37,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:55:37,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:55:37,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:55:37,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-11-27 19:55:37,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:55:37,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:55:37,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-11-27 19:55:37,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:55:37,834 INFO L124 PetriNetUnfolderBase]: 476/926 cut-off events. [2024-11-27 19:55:37,834 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 19:55:37,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1755 conditions, 926 events. 476/926 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5152 event pairs, 200 based on Foata normal form. 0/894 useless extension candidates. Maximal degree in co-relation 1749. Up to 512 conditions per place. [2024-11-27 19:55:37,846 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 24 selfloop transitions, 3 changer transitions 39/74 dead transitions. [2024-11-27 19:55:37,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 74 transitions, 288 flow [2024-11-27 19:55:37,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 19:55:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-27 19:55:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-11-27 19:55:37,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2024-11-27 19:55:37,848 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 8 states and 156 transitions. [2024-11-27 19:55:37,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 74 transitions, 288 flow [2024-11-27 19:55:37,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 74 transitions, 287 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 19:55:37,852 INFO L231 Difference]: Finished difference. Result has 46 places, 29 transitions, 94 flow [2024-11-27 19:55:37,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=94, PETRI_PLACES=46, PETRI_TRANSITIONS=29} [2024-11-27 19:55:37,855 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2024-11-27 19:55:37,855 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 94 flow [2024-11-27 19:55:37,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:55:37,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:55:37,855 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:55:37,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 19:55:37,856 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-27 19:55:37,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:55:37,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1938054129, now seen corresponding path program 1 times [2024-11-27 19:55:37,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:55:37,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876981237] [2024-11-27 19:55:37,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:55:37,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:55:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:55:38,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:55:38,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:55:38,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876981237] [2024-11-27 19:55:38,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876981237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:55:38,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:55:38,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:55:38,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670666218] [2024-11-27 19:55:38,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:55:38,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 19:55:38,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:55:38,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 19:55:38,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:55:38,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-11-27 19:55:38,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 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-11-27 19:55:38,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:55:38,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-11-27 19:55:38,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:55:38,773 INFO L124 PetriNetUnfolderBase]: 337/675 cut-off events. [2024-11-27 19:55:38,773 INFO L125 PetriNetUnfolderBase]: For 413/418 co-relation queries the response was YES. [2024-11-27 19:55:38,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1629 conditions, 675 events. 337/675 cut-off events. For 413/418 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3404 event pairs, 79 based on Foata normal form. 20/690 useless extension candidates. Maximal degree in co-relation 1617. Up to 435 conditions per place. [2024-11-27 19:55:38,778 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 25 selfloop transitions, 3 changer transitions 23/59 dead transitions. [2024-11-27 19:55:38,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 278 flow [2024-11-27 19:55:38,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:55:38,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-27 19:55:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-11-27 19:55:38,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4980694980694981 [2024-11-27 19:55:38,780 INFO L175 Difference]: Start difference. First operand has 46 places, 29 transitions, 94 flow. Second operand 7 states and 129 transitions. [2024-11-27 19:55:38,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 278 flow [2024-11-27 19:55:38,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 59 transitions, 261 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-11-27 19:55:38,784 INFO L231 Difference]: Finished difference. Result has 48 places, 29 transitions, 104 flow [2024-11-27 19:55:38,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=104, PETRI_PLACES=48, PETRI_TRANSITIONS=29} [2024-11-27 19:55:38,785 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2024-11-27 19:55:38,785 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 29 transitions, 104 flow [2024-11-27 19:55:38,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 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-11-27 19:55:38,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:55:38,786 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:55:38,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 19:55:38,786 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-27 19:55:38,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:55:38,786 INFO L85 PathProgramCache]: Analyzing trace with hash 450496585, now seen corresponding path program 1 times [2024-11-27 19:55:38,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:55:38,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345158409] [2024-11-27 19:55:38,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:55:38,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:55:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:55:39,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:55:39,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:55:39,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345158409] [2024-11-27 19:55:39,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345158409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:55:39,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:55:39,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:55:39,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629798592] [2024-11-27 19:55:39,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:55:39,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 19:55:39,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:55:39,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 19:55:39,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:55:39,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-11-27 19:55:39,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 29 transitions, 104 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 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-11-27 19:55:39,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:55:39,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-11-27 19:55:39,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:55:39,435 INFO L124 PetriNetUnfolderBase]: 309/618 cut-off events. [2024-11-27 19:55:39,436 INFO L125 PetriNetUnfolderBase]: For 602/612 co-relation queries the response was YES. [2024-11-27 19:55:39,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1566 conditions, 618 events. 309/618 cut-off events. For 602/612 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2987 event pairs, 165 based on Foata normal form. 26/640 useless extension candidates. Maximal degree in co-relation 1550. Up to 341 conditions per place. [2024-11-27 19:55:39,441 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 26 selfloop transitions, 3 changer transitions 25/62 dead transitions. [2024-11-27 19:55:39,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 62 transitions, 308 flow [2024-11-27 19:55:39,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:55:39,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-27 19:55:39,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-11-27 19:55:39,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5096525096525096 [2024-11-27 19:55:39,444 INFO L175 Difference]: Start difference. First operand has 48 places, 29 transitions, 104 flow. Second operand 7 states and 132 transitions. [2024-11-27 19:55:39,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 62 transitions, 308 flow [2024-11-27 19:55:39,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 62 transitions, 278 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-11-27 19:55:39,449 INFO L231 Difference]: Finished difference. Result has 49 places, 29 transitions, 105 flow [2024-11-27 19:55:39,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=105, PETRI_PLACES=49, PETRI_TRANSITIONS=29} [2024-11-27 19:55:39,453 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2024-11-27 19:55:39,453 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 29 transitions, 105 flow [2024-11-27 19:55:39,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 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-11-27 19:55:39,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:55:39,454 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-11-27 19:55:39,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 19:55:39,454 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-27 19:55:39,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:55:39,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2063761501, now seen corresponding path program 1 times [2024-11-27 19:55:39,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:55:39,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694776169] [2024-11-27 19:55:39,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:55:39,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:55:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:55:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:55:39,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:55:39,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694776169] [2024-11-27 19:55:39,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694776169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:55:39,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:55:39,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:55:39,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176416326] [2024-11-27 19:55:39,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:55:39,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:55:39,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:55:39,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:55:39,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:55:39,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-11-27 19:55:39,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 29 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:55:39,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:55:39,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-11-27 19:55:39,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:55:39,962 INFO L124 PetriNetUnfolderBase]: 245/498 cut-off events. [2024-11-27 19:55:39,963 INFO L125 PetriNetUnfolderBase]: For 313/315 co-relation queries the response was YES. [2024-11-27 19:55:39,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 498 events. 245/498 cut-off events. For 313/315 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2233 event pairs, 48 based on Foata normal form. 34/522 useless extension candidates. Maximal degree in co-relation 1189. Up to 211 conditions per place. [2024-11-27 19:55:39,966 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 35 selfloop transitions, 4 changer transitions 1/49 dead transitions. [2024-11-27 19:55:39,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 241 flow [2024-11-27 19:55:39,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:55:39,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-27 19:55:39,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2024-11-27 19:55:39,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6013513513513513 [2024-11-27 19:55:39,968 INFO L175 Difference]: Start difference. First operand has 49 places, 29 transitions, 105 flow. Second operand 4 states and 89 transitions. [2024-11-27 19:55:39,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 241 flow [2024-11-27 19:55:39,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 213 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-11-27 19:55:39,971 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 111 flow [2024-11-27 19:55:39,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2024-11-27 19:55:39,972 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2024-11-27 19:55:39,972 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 111 flow [2024-11-27 19:55:39,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:55:39,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:55:39,973 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-11-27 19:55:39,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 19:55:39,973 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-27 19:55:39,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:55:39,974 INFO L85 PathProgramCache]: Analyzing trace with hash -340504463, now seen corresponding path program 1 times [2024-11-27 19:55:39,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:55:39,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863100897] [2024-11-27 19:55:39,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:55:39,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:55:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:55:40,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:55:40,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:55:40,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863100897] [2024-11-27 19:55:40,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863100897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:55:40,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:55:40,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 19:55:40,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000973608] [2024-11-27 19:55:40,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:55:40,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 19:55:40,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:55:40,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 19:55:40,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:55:40,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-11-27 19:55:40,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 111 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:55:40,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:55:40,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-11-27 19:55:40,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:55:40,659 INFO L124 PetriNetUnfolderBase]: 299/640 cut-off events. [2024-11-27 19:55:40,659 INFO L125 PetriNetUnfolderBase]: For 202/209 co-relation queries the response was YES. [2024-11-27 19:55:40,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1504 conditions, 640 events. 299/640 cut-off events. For 202/209 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3248 event pairs, 85 based on Foata normal form. 13/639 useless extension candidates. Maximal degree in co-relation 1491. Up to 280 conditions per place. [2024-11-27 19:55:40,663 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 31 selfloop transitions, 2 changer transitions 17/61 dead transitions. [2024-11-27 19:55:40,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 288 flow [2024-11-27 19:55:40,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 19:55:40,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 19:55:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-11-27 19:55:40,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5225225225225225 [2024-11-27 19:55:40,665 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 111 flow. Second operand 6 states and 116 transitions. [2024-11-27 19:55:40,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 288 flow [2024-11-27 19:55:40,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 277 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-27 19:55:40,667 INFO L231 Difference]: Finished difference. Result has 49 places, 32 transitions, 121 flow [2024-11-27 19:55:40,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=121, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2024-11-27 19:55:40,670 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2024-11-27 19:55:40,670 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 121 flow [2024-11-27 19:55:40,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:55:40,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:55:40,671 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-11-27 19:55:40,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 19:55:40,671 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-27 19:55:40,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:55:40,672 INFO L85 PathProgramCache]: Analyzing trace with hash 825128191, now seen corresponding path program 2 times [2024-11-27 19:55:40,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:55:40,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365916401] [2024-11-27 19:55:40,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 19:55:40,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:55:40,759 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 19:55:40,759 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:55:41,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:55:41,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:55:41,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365916401] [2024-11-27 19:55:41,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365916401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:55:41,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:55:41,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:55:41,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894791089] [2024-11-27 19:55:41,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:55:41,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:55:41,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:55:41,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:55:41,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:55:41,025 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-11-27 19:55:41,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 32 transitions, 121 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:55:41,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:55:41,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-11-27 19:55:41,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:55:41,220 INFO L124 PetriNetUnfolderBase]: 198/406 cut-off events. [2024-11-27 19:55:41,220 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2024-11-27 19:55:41,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 973 conditions, 406 events. 198/406 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1659 event pairs, 47 based on Foata normal form. 34/431 useless extension candidates. Maximal degree in co-relation 957. Up to 173 conditions per place. [2024-11-27 19:55:41,223 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 26 selfloop transitions, 6 changer transitions 5/46 dead transitions. [2024-11-27 19:55:41,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 227 flow [2024-11-27 19:55:41,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:55:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 19:55:41,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2024-11-27 19:55:41,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5243243243243243 [2024-11-27 19:55:41,224 INFO L175 Difference]: Start difference. First operand has 49 places, 32 transitions, 121 flow. Second operand 5 states and 97 transitions. [2024-11-27 19:55:41,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 227 flow [2024-11-27 19:55:41,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 209 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-27 19:55:41,226 INFO L231 Difference]: Finished difference. Result has 48 places, 30 transitions, 117 flow [2024-11-27 19:55:41,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2024-11-27 19:55:41,230 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2024-11-27 19:55:41,230 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 117 flow [2024-11-27 19:55:41,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:55:41,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:55:41,231 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:55:41,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 19:55:41,231 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-27 19:55:41,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:55:41,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1069819956, now seen corresponding path program 1 times [2024-11-27 19:55:41,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:55:41,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307585772] [2024-11-27 19:55:41,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:55:41,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:55:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 19:55:41,435 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 19:55:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 19:55:41,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 19:55:41,604 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 19:55:41,605 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-27 19:55:41,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-27 19:55:41,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-27 19:55:41,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-27 19:55:41,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-27 19:55:41,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-27 19:55:41,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 19:55:41,608 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:55:41,722 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-27 19:55:41,722 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 19:55:41,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 07:55:41 BasicIcfg [2024-11-27 19:55:41,728 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 19:55:41,730 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 19:55:41,731 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 19:55:41,731 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 19:55:41,731 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:55:34" (3/4) ... [2024-11-27 19:55:41,734 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-27 19:55:41,735 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 19:55:41,736 INFO L158 Benchmark]: Toolchain (without parser) took 8361.80ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 93.0MB in the beginning and 315.6MB in the end (delta: -222.7MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-11-27 19:55:41,736 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 142.6MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 19:55:41,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 541.91ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 69.3MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-27 19:55:41,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.68ms. Allocated memory is still 117.4MB. Free memory was 69.3MB in the beginning and 66.4MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 19:55:41,739 INFO L158 Benchmark]: Boogie Preprocessor took 49.55ms. Allocated memory is still 117.4MB. Free memory was 66.4MB in the beginning and 63.0MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 19:55:41,742 INFO L158 Benchmark]: RCFGBuilder took 965.29ms. Allocated memory is still 117.4MB. Free memory was 63.0MB in the beginning and 61.9MB in the end (delta: 1.1MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-11-27 19:55:41,742 INFO L158 Benchmark]: TraceAbstraction took 6740.32ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 61.3MB in the beginning and 315.7MB in the end (delta: -254.4MB). Peak memory consumption was 180.7MB. Max. memory is 16.1GB. [2024-11-27 19:55:41,743 INFO L158 Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 352.3MB. Free memory was 315.7MB in the beginning and 315.6MB in the end (delta: 46.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 19:55:41,744 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.34ms. Allocated memory is still 142.6MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 541.91ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 69.3MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.68ms. Allocated memory is still 117.4MB. Free memory was 69.3MB in the beginning and 66.4MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.55ms. Allocated memory is still 117.4MB. Free memory was 66.4MB in the beginning and 63.0MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 965.29ms. Allocated memory is still 117.4MB. Free memory was 63.0MB in the beginning and 61.9MB in the end (delta: 1.1MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6740.32ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 61.3MB in the beginning and 315.7MB in the end (delta: -254.4MB). Peak memory consumption was 180.7MB. Max. memory is 16.1GB. * Witness Printer took 4.50ms. Allocated memory is still 352.3MB. Free memory was 315.7MB in the beginning and 315.6MB in the end (delta: 46.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t0; [L832] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0=-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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 1 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L833] 0 pthread_t t1; [L834] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0=-1, t1=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L770] 1 __unbuffered_p0_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L787] 2 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L790] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L793] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 2 y$flush_delayed = weak$$choice2 [L796] 2 y$mem_tmp = y [L797] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L798] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L799] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L800] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L801] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L802] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L803] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L804] 2 __unbuffered_p1_EBX = y [L805] 2 y = y$flush_delayed ? y$mem_tmp : y [L806] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L773] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L774] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L775] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L776] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L777] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0: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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L809] 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) [L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L811] 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 [L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L813] 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}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0: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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0=-1, t1=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 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) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 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 [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L844] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0=-1, t1=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0=-1, t1=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L18] 0 __assert_fail ("0", "mix000.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that 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: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 240 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 222 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 694 IncrementalHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 16 mSDtfsCounter, 694 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=7, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 469 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-27 19:55:41,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 62286332e049ab35f6bf4022df54bae198ba0ceaf820c98713e2f1f442f473b5 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 19:55:44,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 19:55:44,545 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-27 19:55:44,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 19:55:44,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 19:55:44,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 19:55:44,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 19:55:44,602 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 19:55:44,603 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 19:55:44,603 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 19:55:44,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 19:55:44,604 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 19:55:44,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 19:55:44,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 19:55:44,605 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 19:55:44,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 19:55:44,605 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 19:55:44,605 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 19:55:44,605 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 19:55:44,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 19:55:44,606 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 19:55:44,606 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 19:55:44,606 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 19:55:44,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 19:55:44,606 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 19:55:44,606 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 19:55:44,606 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 19:55:44,606 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 19:55:44,606 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 19:55:44,606 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 19:55:44,606 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 19:55:44,607 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 19:55:44,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:55:44,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:55:44,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:55:44,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:55:44,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 19:55:44,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:55:44,608 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:55:44,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:55:44,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:55:44,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 19:55:44,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 19:55:44,609 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 19:55:44,609 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 19:55:44,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 19:55:44,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 19:55:44,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 19:55:44,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 19:55:44,609 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_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 62286332e049ab35f6bf4022df54bae198ba0ceaf820c98713e2f1f442f473b5 [2024-11-27 19:55:44,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 19:55:44,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 19:55:44,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 19:55:44,945 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 19:55:44,946 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 19:55:44,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/mix000.oepc.i [2024-11-27 19:55:47,847 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/data/4f8217919/fb63f954ccc8440598231cd8af33f730/FLAGc213f0382 [2024-11-27 19:55:48,271 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 19:55:48,274 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/sv-benchmarks/c/pthread-wmm/mix000.oepc.i [2024-11-27 19:55:48,293 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/data/4f8217919/fb63f954ccc8440598231cd8af33f730/FLAGc213f0382 [2024-11-27 19:55:48,315 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/data/4f8217919/fb63f954ccc8440598231cd8af33f730 [2024-11-27 19:55:48,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 19:55:48,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 19:55:48,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 19:55:48,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 19:55:48,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 19:55:48,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:55:48" (1/1) ... [2024-11-27 19:55:48,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38968324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:48, skipping insertion in model container [2024-11-27 19:55:48,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:55:48" (1/1) ... [2024-11-27 19:55:48,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 19:55:48,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:55:48,893 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 19:55:48,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:55:49,048 INFO L204 MainTranslator]: Completed translation [2024-11-27 19:55:49,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:49 WrapperNode [2024-11-27 19:55:49,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 19:55:49,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 19:55:49,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 19:55:49,053 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 19:55:49,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:49" (1/1) ... [2024-11-27 19:55:49,096 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:49" (1/1) ... [2024-11-27 19:55:49,143 INFO L138 Inliner]: procedures = 175, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 133 [2024-11-27 19:55:49,144 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 19:55:49,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 19:55:49,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 19:55:49,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 19:55:49,164 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:49" (1/1) ... [2024-11-27 19:55:49,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:49" (1/1) ... [2024-11-27 19:55:49,170 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:49" (1/1) ... [2024-11-27 19:55:49,187 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-27 19:55:49,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:49" (1/1) ... [2024-11-27 19:55:49,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:49" (1/1) ... [2024-11-27 19:55:49,196 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:49" (1/1) ... [2024-11-27 19:55:49,197 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:49" (1/1) ... [2024-11-27 19:55:49,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:49" (1/1) ... [2024-11-27 19:55:49,202 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:49" (1/1) ... [2024-11-27 19:55:49,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:49" (1/1) ... [2024-11-27 19:55:49,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 19:55:49,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 19:55:49,240 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 19:55:49,240 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 19:55:49,241 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:49" (1/1) ... [2024-11-27 19:55:49,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:55:49,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:55:49,290 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 19:55:49,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 19:55:49,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-27 19:55:49,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 19:55:49,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 19:55:49,326 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-27 19:55:49,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-27 19:55:49,327 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-27 19:55:49,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-27 19:55:49,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-27 19:55:49,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 19:55:49,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 19:55:49,329 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-27 19:55:49,521 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 19:55:49,523 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 19:55:49,971 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-27 19:55:49,972 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 19:55:50,380 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 19:55:50,381 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 19:55:50,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:55:50 BoogieIcfgContainer [2024-11-27 19:55:50,381 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 19:55:50,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 19:55:50,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 19:55:50,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 19:55:50,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 07:55:48" (1/3) ... [2024-11-27 19:55:50,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc52611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:55:50, skipping insertion in model container [2024-11-27 19:55:50,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:55:49" (2/3) ... [2024-11-27 19:55:50,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc52611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:55:50, skipping insertion in model container [2024-11-27 19:55:50,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:55:50" (3/3) ... [2024-11-27 19:55:50,398 INFO L128 eAbstractionObserver]: Analyzing ICFG mix000.oepc.i [2024-11-27 19:55:50,418 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 19:55:50,419 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix000.oepc.i that has 3 procedures, 36 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-27 19:55:50,420 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-27 19:55:50,520 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-27 19:55:50,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 82 flow [2024-11-27 19:55:50,633 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-11-27 19:55:50,638 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 19:55:50,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 2/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2024-11-27 19:55:50,643 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 82 flow [2024-11-27 19:55:50,648 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 35 transitions, 76 flow [2024-11-27 19:55:50,662 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 19:55:50,680 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;@2816bcee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 19:55:50,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-27 19:55:50,686 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 19:55:50,686 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-27 19:55:50,686 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 19:55:50,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:55:50,687 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-27 19:55:50,688 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-27 19:55:50,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:55:50,695 INFO L85 PathProgramCache]: Analyzing trace with hash 12115476, now seen corresponding path program 1 times [2024-11-27 19:55:50,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:55:50,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [601621477] [2024-11-27 19:55:50,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:55:50,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:55:50,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:55:50,714 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:55:50,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 19:55:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:55:50,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 19:55:50,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:55:50,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:55:50,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:55:50,934 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:55:50,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601621477] [2024-11-27 19:55:50,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601621477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:55:50,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:55:50,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 19:55:50,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561147353] [2024-11-27 19:55:50,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:55:50,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:55:50,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:55:50,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:55:50,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:55:50,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-11-27 19:55:50,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:55:50,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:55:50,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-11-27 19:55:50,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:55:51,478 INFO L124 PetriNetUnfolderBase]: 237/502 cut-off events. [2024-11-27 19:55:51,478 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-27 19:55:51,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 502 events. 237/502 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2777 event pairs, 21 based on Foata normal form. 40/537 useless extension candidates. Maximal degree in co-relation 916. Up to 353 conditions per place. [2024-11-27 19:55:51,488 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 26 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2024-11-27 19:55:51,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 155 flow [2024-11-27 19:55:51,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:55:51,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:55:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-27 19:55:51,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7207207207207207 [2024-11-27 19:55:51,506 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 76 flow. Second operand 3 states and 80 transitions. [2024-11-27 19:55:51,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 155 flow [2024-11-27 19:55:51,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 19:55:51,516 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 68 flow [2024-11-27 19:55:51,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-11-27 19:55:51,522 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2024-11-27 19:55:51,524 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 68 flow [2024-11-27 19:55:51,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:55:51,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:55:51,525 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:55:51,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-27 19:55:51,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:55:51,730 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-27 19:55:51,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:55:51,731 INFO L85 PathProgramCache]: Analyzing trace with hash 372482432, now seen corresponding path program 1 times [2024-11-27 19:55:51,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:55:51,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [495639040] [2024-11-27 19:55:51,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:55:51,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:55:51,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:55:51,734 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:55:51,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 19:55:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:55:51,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-27 19:55:51,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:55:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:55:51,874 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:55:51,874 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:55:51,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495639040] [2024-11-27 19:55:51,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495639040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:55:51,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:55:51,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 19:55:51,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428872344] [2024-11-27 19:55:51,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:55:51,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:55:51,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:55:51,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:55:51,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:55:51,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-11-27 19:55:51,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:55:51,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:55:51,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-11-27 19:55:51,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:55:52,044 INFO L124 PetriNetUnfolderBase]: 206/472 cut-off events. [2024-11-27 19:55:52,044 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-27 19:55:52,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 472 events. 206/472 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2623 event pairs, 206 based on Foata normal form. 20/473 useless extension candidates. Maximal degree in co-relation 865. Up to 357 conditions per place. [2024-11-27 19:55:52,051 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 15 selfloop transitions, 1 changer transitions 1/29 dead transitions. [2024-11-27 19:55:52,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 100 flow [2024-11-27 19:55:52,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:55:52,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:55:52,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-11-27 19:55:52,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2024-11-27 19:55:52,054 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 68 flow. Second operand 3 states and 60 transitions. [2024-11-27 19:55:52,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 100 flow [2024-11-27 19:55:52,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 19:55:52,056 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2024-11-27 19:55:52,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2024-11-27 19:55:52,057 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2024-11-27 19:55:52,057 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2024-11-27 19:55:52,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:55:52,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:55:52,058 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:55:52,068 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-27 19:55:52,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:55:52,259 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-27 19:55:52,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:55:52,260 INFO L85 PathProgramCache]: Analyzing trace with hash 372482509, now seen corresponding path program 1 times [2024-11-27 19:55:52,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:55:52,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1720915905] [2024-11-27 19:55:52,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:55:52,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:55:52,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:55:52,263 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:55:52,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 19:55:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:55:52,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 19:55:52,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:55:52,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:55:52,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:55:52,412 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:55:52,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720915905] [2024-11-27 19:55:52,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720915905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:55:52,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:55:52,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:55:52,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940496385] [2024-11-27 19:55:52,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:55:52,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:55:52,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:55:52,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:55:52,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:55:52,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-11-27 19:55:52,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:55:52,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:55:52,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-11-27 19:55:52,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:55:52,644 INFO L124 PetriNetUnfolderBase]: 235/511 cut-off events. [2024-11-27 19:55:52,644 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 19:55:52,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 511 events. 235/511 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2480 event pairs, 52 based on Foata normal form. 30/531 useless extension candidates. Maximal degree in co-relation 951. Up to 216 conditions per place. [2024-11-27 19:55:52,648 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 34 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2024-11-27 19:55:52,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 182 flow [2024-11-27 19:55:52,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:55:52,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-27 19:55:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2024-11-27 19:55:52,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6013513513513513 [2024-11-27 19:55:52,650 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 4 states and 89 transitions. [2024-11-27 19:55:52,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 182 flow [2024-11-27 19:55:52,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 181 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 19:55:52,652 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 87 flow [2024-11-27 19:55:52,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2024-11-27 19:55:52,653 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2024-11-27 19:55:52,653 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 87 flow [2024-11-27 19:55:52,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:55:52,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:55:52,654 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-11-27 19:55:52,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-27 19:55:52,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:55:52,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-27 19:55:52,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:55:52,856 INFO L85 PathProgramCache]: Analyzing trace with hash 956621113, now seen corresponding path program 1 times [2024-11-27 19:55:52,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:55:52,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1475750605] [2024-11-27 19:55:52,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:55:52,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:55:52,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:55:52,859 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:55:52,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 19:55:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:55:52,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 19:55:52,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:55:53,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:55:53,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:55:53,049 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:55:53,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475750605] [2024-11-27 19:55:53,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475750605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:55:53,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:55:53,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:55:53,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669104407] [2024-11-27 19:55:53,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:55:53,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:55:53,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:55:53,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:55:53,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:55:53,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-11-27 19:55:53,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:55:53,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:55:53,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-11-27 19:55:53,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:55:53,258 INFO L124 PetriNetUnfolderBase]: 120/258 cut-off events. [2024-11-27 19:55:53,258 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-11-27 19:55:53,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 258 events. 120/258 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 897 event pairs, 36 based on Foata normal form. 18/269 useless extension candidates. Maximal degree in co-relation 589. Up to 101 conditions per place. [2024-11-27 19:55:53,261 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 28 selfloop transitions, 6 changer transitions 1/44 dead transitions. [2024-11-27 19:55:53,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 190 flow [2024-11-27 19:55:53,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:55:53,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 19:55:53,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2024-11-27 19:55:53,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5243243243243243 [2024-11-27 19:55:53,264 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 87 flow. Second operand 5 states and 97 transitions. [2024-11-27 19:55:53,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 190 flow [2024-11-27 19:55:53,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 181 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-27 19:55:53,266 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 103 flow [2024-11-27 19:55:53,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2024-11-27 19:55:53,268 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2024-11-27 19:55:53,268 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 103 flow [2024-11-27 19:55:53,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:55:53,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:55:53,269 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:55:53,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-27 19:55:53,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:55:53,470 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-27 19:55:53,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:55:53,470 INFO L85 PathProgramCache]: Analyzing trace with hash -162737820, now seen corresponding path program 1 times [2024-11-27 19:55:53,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:55:53,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2002612484] [2024-11-27 19:55:53,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:55:53,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:55:53,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:55:53,474 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:55:53,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 19:55:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:55:53,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-27 19:55:53,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:55:53,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:55:53,875 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:55:53,875 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:55:53,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002612484] [2024-11-27 19:55:53,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002612484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:55:53,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:55:53,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 19:55:53,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022244908] [2024-11-27 19:55:53,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:55:53,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 19:55:53,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:55:53,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 19:55:53,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-27 19:55:53,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-11-27 19:55:53,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 103 flow. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:55:53,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:55:53,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-11-27 19:55:53,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:55:54,408 INFO L124 PetriNetUnfolderBase]: 199/411 cut-off events. [2024-11-27 19:55:54,408 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2024-11-27 19:55:54,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 411 events. 199/411 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1548 event pairs, 44 based on Foata normal form. 4/414 useless extension candidates. Maximal degree in co-relation 985. Up to 159 conditions per place. [2024-11-27 19:55:54,411 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 34 selfloop transitions, 5 changer transitions 26/71 dead transitions. [2024-11-27 19:55:54,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 71 transitions, 357 flow [2024-11-27 19:55:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 19:55:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-27 19:55:54,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2024-11-27 19:55:54,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44144144144144143 [2024-11-27 19:55:54,414 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 103 flow. Second operand 9 states and 147 transitions. [2024-11-27 19:55:54,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 71 transitions, 357 flow [2024-11-27 19:55:54,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 71 transitions, 300 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-11-27 19:55:54,417 INFO L231 Difference]: Finished difference. Result has 51 places, 32 transitions, 109 flow [2024-11-27 19:55:54,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=109, PETRI_PLACES=51, PETRI_TRANSITIONS=32} [2024-11-27 19:55:54,418 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2024-11-27 19:55:54,419 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 32 transitions, 109 flow [2024-11-27 19:55:54,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:55:54,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:55:54,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:55:54,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-27 19:55:54,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:55:54,624 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-27 19:55:54,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:55:54,625 INFO L85 PathProgramCache]: Analyzing trace with hash 313151756, now seen corresponding path program 2 times [2024-11-27 19:55:54,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:55:54,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [53971403] [2024-11-27 19:55:54,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 19:55:54,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:55:54,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:55:54,630 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:55:54,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 19:55:54,761 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 19:55:54,762 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:55:54,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-27 19:55:54,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:55:56,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:55:56,230 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:55:56,230 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:55:56,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53971403] [2024-11-27 19:55:56,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53971403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:55:56,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:55:56,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 19:55:56,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293010875] [2024-11-27 19:55:56,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:55:56,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 19:55:56,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:55:56,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 19:55:56,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-27 19:55:56,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-11-27 19:55:56,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 32 transitions, 109 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 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-11-27 19:55:56,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:55:56,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-11-27 19:55:56,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:55:57,062 INFO L124 PetriNetUnfolderBase]: 155/336 cut-off events. [2024-11-27 19:55:57,062 INFO L125 PetriNetUnfolderBase]: For 71/73 co-relation queries the response was YES. [2024-11-27 19:55:57,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 802 conditions, 336 events. 155/336 cut-off events. For 71/73 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1192 event pairs, 34 based on Foata normal form. 6/340 useless extension candidates. Maximal degree in co-relation 788. Up to 151 conditions per place. [2024-11-27 19:55:57,065 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 38 selfloop transitions, 14 changer transitions 22/83 dead transitions. [2024-11-27 19:55:57,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 83 transitions, 403 flow [2024-11-27 19:55:57,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-27 19:55:57,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-27 19:55:57,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 217 transitions. [2024-11-27 19:55:57,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45114345114345117 [2024-11-27 19:55:57,068 INFO L175 Difference]: Start difference. First operand has 51 places, 32 transitions, 109 flow. Second operand 13 states and 217 transitions. [2024-11-27 19:55:57,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 83 transitions, 403 flow [2024-11-27 19:55:57,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 83 transitions, 371 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-11-27 19:55:57,071 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 184 flow [2024-11-27 19:55:57,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=184, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2024-11-27 19:55:57,072 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2024-11-27 19:55:57,072 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 184 flow [2024-11-27 19:55:57,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 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-11-27 19:55:57,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:55:57,073 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:55:57,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-27 19:55:57,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:55:57,278 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-27 19:55:57,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:55:57,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1168633180, now seen corresponding path program 3 times [2024-11-27 19:55:57,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:55:57,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [137115676] [2024-11-27 19:55:57,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 19:55:57,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:55:57,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:55:57,282 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:55:57,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 19:55:57,407 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-27 19:55:57,407 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-27 19:55:57,407 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 19:55:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 19:55:57,532 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-27 19:55:57,532 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 19:55:57,533 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-27 19:55:57,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-27 19:55:57,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-27 19:55:57,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-27 19:55:57,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-27 19:55:57,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-27 19:55:57,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-27 19:55:57,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:55:57,737 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-11-27 19:55:57,855 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-27 19:55:57,855 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 19:55:57,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 07:55:57 BasicIcfg [2024-11-27 19:55:57,865 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 19:55:57,866 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 19:55:57,866 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 19:55:57,866 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 19:55:57,869 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:55:50" (3/4) ... [2024-11-27 19:55:57,871 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-27 19:55:57,872 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 19:55:57,874 INFO L158 Benchmark]: Toolchain (without parser) took 9551.83ms. Allocated memory was 83.9MB in the beginning and 226.5MB in the end (delta: 142.6MB). Free memory was 60.8MB in the beginning and 105.3MB in the end (delta: -44.5MB). Peak memory consumption was 101.9MB. Max. memory is 16.1GB. [2024-11-27 19:55:57,874 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 83.9MB. Free memory is still 49.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 19:55:57,875 INFO L158 Benchmark]: CACSL2BoogieTranslator took 729.77ms. Allocated memory is still 83.9MB. Free memory was 60.6MB in the beginning and 36.8MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-27 19:55:57,875 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.92ms. Allocated memory is still 83.9MB. Free memory was 36.8MB in the beginning and 34.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 19:55:57,875 INFO L158 Benchmark]: Boogie Preprocessor took 59.68ms. Allocated memory is still 83.9MB. Free memory was 34.3MB in the beginning and 31.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 19:55:57,876 INFO L158 Benchmark]: RCFGBuilder took 1141.66ms. Allocated memory was 83.9MB in the beginning and 184.5MB in the end (delta: 100.7MB). Free memory was 60.9MB in the beginning and 124.3MB in the end (delta: -63.4MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2024-11-27 19:55:57,880 INFO L158 Benchmark]: TraceAbstraction took 7479.79ms. Allocated memory was 184.5MB in the beginning and 226.5MB in the end (delta: 41.9MB). Free memory was 123.4MB in the beginning and 105.3MB in the end (delta: 18.1MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. [2024-11-27 19:55:57,881 INFO L158 Benchmark]: Witness Printer took 6.04ms. Allocated memory is still 226.5MB. Free memory was 105.3MB in the beginning and 105.3MB in the end (delta: 29.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 19:55:57,883 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 49.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 729.77ms. Allocated memory is still 83.9MB. Free memory was 60.6MB in the beginning and 36.8MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.92ms. Allocated memory is still 83.9MB. Free memory was 36.8MB in the beginning and 34.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.68ms. Allocated memory is still 83.9MB. Free memory was 34.3MB in the beginning and 31.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1141.66ms. Allocated memory was 83.9MB in the beginning and 184.5MB in the end (delta: 100.7MB). Free memory was 60.9MB in the beginning and 124.3MB in the end (delta: -63.4MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7479.79ms. Allocated memory was 184.5MB in the beginning and 226.5MB in the end (delta: 41.9MB). Free memory was 123.4MB in the beginning and 105.3MB in the end (delta: 18.1MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. * Witness Printer took 6.04ms. Allocated memory is still 226.5MB. Free memory was 105.3MB in the beginning and 105.3MB in the end (delta: 29.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t0; [L832] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0=524286, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L833] 0 pthread_t t1; [L834] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0=524286, t1=524287, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 1 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L770] 1 __unbuffered_p0_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L787] 2 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L790] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L793] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 2 y$flush_delayed = weak$$choice2 [L796] 2 y$mem_tmp = y [L797] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L798] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L799] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L800] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L801] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L802] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L803] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L804] 2 __unbuffered_p1_EBX = y [L805] 2 y = y$flush_delayed ? y$mem_tmp : y [L806] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L809] 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) [L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L811] 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 [L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L813] 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}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L773] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L774] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L775] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L776] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L777] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0=524286, t1=524287, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 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) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 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 [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L844] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0=524286, t1=524287, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0=524286, t1=524287, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L18] 0 __assert_fail ("0", "mix000.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that 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: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 217 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 199 mSDsluCounter, 112 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 792 IncrementalHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 4 mSDtfsCounter, 792 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184occurred in iteration=6, InterpolantAutomatonStates: 37, 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, 2.0s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 581 SizeOfPredicates, 21 NumberOfNonLiveVariables, 539 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-27 19:55:57,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219c00f7-bb36-448e-b3d1-1885eeaa90e1/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample